./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:10:15,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:10:15,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:10:15,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:10:15,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:10:15,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:10:15,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:10:15,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:10:15,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:10:15,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:10:15,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:10:15,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:10:15,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:10:15,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:10:15,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:10:15,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:10:15,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:10:15,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:10:15,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:10:15,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:10:15,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:10:15,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:10:15,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:10:15,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:15,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:10:15,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:10:15,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:10:15,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:10:15,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:10:15,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:10:15,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2024-11-08 18:10:16,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:10:16,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:10:16,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:10:16,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:10:16,166 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:10:16,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-08 18:10:17,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:10:17,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:10:17,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-08 18:10:17,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ac1351b/17e219d6637c420fb5c62d120693c736/FLAGb036026aa [2024-11-08 18:10:18,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ac1351b/17e219d6637c420fb5c62d120693c736 [2024-11-08 18:10:18,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:10:18,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:10:18,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:18,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:10:18,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:10:18,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:18,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7a7172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18, skipping insertion in model container [2024-11-08 18:10:18,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:18,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:10:18,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-08 18:10:18,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:18,715 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:10:18,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-08 18:10:18,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:18,863 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:10:18,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18 WrapperNode [2024-11-08 18:10:18,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:18,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:18,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:10:18,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:10:18,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:18,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,196 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-11-08 18:10:19,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:19,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:10:19,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:10:19,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:10:19,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,441 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-11-08 18:10:19,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:10:19,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:10:19,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:10:19,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:10:19,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (1/1) ... [2024-11-08 18:10:19,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:10:19,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:10:19,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:10:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:10:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:10:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:10:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:10:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:10:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:10:19,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:10:19,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:10:21,454 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-08 18:10:21,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:10:21,486 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:10:21,489 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:10:21,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:21 BoogieIcfgContainer [2024-11-08 18:10:21,490 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:10:21,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:10:21,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:10:21,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:10:21,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:10:18" (1/3) ... [2024-11-08 18:10:21,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fb75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:21, skipping insertion in model container [2024-11-08 18:10:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:18" (2/3) ... [2024-11-08 18:10:21,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56fb75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:21, skipping insertion in model container [2024-11-08 18:10:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:21" (3/3) ... [2024-11-08 18:10:21,499 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-08 18:10:21,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:10:21,517 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:10:21,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:10:21,609 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;@504336c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:10:21,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:10:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:10:21,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:21,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:21,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1656611576, now seen corresponding path program 1 times [2024-11-08 18:10:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:21,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110863138] [2024-11-08 18:10:21,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:22,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110863138] [2024-11-08 18:10:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110863138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:22,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:22,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:10:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483495596] [2024-11-08 18:10:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:22,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:10:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:10:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:10:22,147 INFO L87 Difference]: Start difference. First operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:22,194 INFO L93 Difference]: Finished difference Result 711 states and 1061 transitions. [2024-11-08 18:10:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:10:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2024-11-08 18:10:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:22,211 INFO L225 Difference]: With dead ends: 711 [2024-11-08 18:10:22,211 INFO L226 Difference]: Without dead ends: 389 [2024-11-08 18:10:22,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:10:22,219 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:22,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-08 18:10:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-08 18:10:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 384 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 577 transitions. [2024-11-08 18:10:22,279 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 577 transitions. Word has length 117 [2024-11-08 18:10:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 577 transitions. [2024-11-08 18:10:22,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 577 transitions. [2024-11-08 18:10:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 18:10:22,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:22,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:10:22,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 782291010, now seen corresponding path program 1 times [2024-11-08 18:10:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:22,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303377224] [2024-11-08 18:10:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:23,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303377224] [2024-11-08 18:10:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303377224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:23,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:23,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843881418] [2024-11-08 18:10:23,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:23,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:23,346 INFO L87 Difference]: Start difference. First operand 389 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:23,417 INFO L93 Difference]: Finished difference Result 393 states and 581 transitions. [2024-11-08 18:10:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-11-08 18:10:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:23,422 INFO L225 Difference]: With dead ends: 393 [2024-11-08 18:10:23,422 INFO L226 Difference]: Without dead ends: 391 [2024-11-08 18:10:23,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:23,423 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:23,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-08 18:10:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-08 18:10:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4844559585492227) internal successors, (573), 386 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 579 transitions. [2024-11-08 18:10:23,453 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 579 transitions. Word has length 117 [2024-11-08 18:10:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 579 transitions. [2024-11-08 18:10:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 579 transitions. [2024-11-08 18:10:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 18:10:23,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:23,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:23,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:10:23,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:23,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086696, now seen corresponding path program 1 times [2024-11-08 18:10:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030810193] [2024-11-08 18:10:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030810193] [2024-11-08 18:10:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030810193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486074181] [2024-11-08 18:10:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:23,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:23,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:23,965 INFO L87 Difference]: Start difference. First operand 391 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:24,384 INFO L93 Difference]: Finished difference Result 971 states and 1441 transitions. [2024-11-08 18:10:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:10:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-08 18:10:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:24,389 INFO L225 Difference]: With dead ends: 971 [2024-11-08 18:10:24,390 INFO L226 Difference]: Without dead ends: 391 [2024-11-08 18:10:24,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-11-08 18:10:24,393 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1090 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:24,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1687 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:10:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-08 18:10:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-08 18:10:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4818652849740932) internal successors, (572), 386 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions. [2024-11-08 18:10:24,419 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 118 [2024-11-08 18:10:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:24,420 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 578 transitions. [2024-11-08 18:10:24,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions. [2024-11-08 18:10:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 18:10:24,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:24,424 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:10:24,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:24,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:24,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1565089340, now seen corresponding path program 1 times [2024-11-08 18:10:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383964646] [2024-11-08 18:10:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383964646] [2024-11-08 18:10:24,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383964646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:24,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:24,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525158439] [2024-11-08 18:10:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:24,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:24,844 INFO L87 Difference]: Start difference. First operand 391 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:24,882 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2024-11-08 18:10:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-11-08 18:10:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:24,886 INFO L225 Difference]: With dead ends: 714 [2024-11-08 18:10:24,886 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:24,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:24,888 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:24,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1712 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 580 transitions. [2024-11-08 18:10:24,906 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 580 transitions. Word has length 119 [2024-11-08 18:10:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:24,907 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 580 transitions. [2024-11-08 18:10:24,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 580 transitions. [2024-11-08 18:10:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 18:10:24,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:24,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:24,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:10:24,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 175163959, now seen corresponding path program 1 times [2024-11-08 18:10:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660937103] [2024-11-08 18:10:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660937103] [2024-11-08 18:10:25,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660937103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:25,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:25,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:25,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33791037] [2024-11-08 18:10:25,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:25,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:25,470 INFO L87 Difference]: Start difference. First operand 393 states and 580 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:25,542 INFO L93 Difference]: Finished difference Result 716 states and 1056 transitions. [2024-11-08 18:10:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-11-08 18:10:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:25,545 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:25,545 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:25,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:25,547 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 487 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:25,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4742268041237114) internal successors, (572), 388 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 578 transitions. [2024-11-08 18:10:25,559 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 578 transitions. Word has length 120 [2024-11-08 18:10:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:25,560 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 578 transitions. [2024-11-08 18:10:25,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 578 transitions. [2024-11-08 18:10:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 18:10:25,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:25,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:25,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:10:25,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:25,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1490569844, now seen corresponding path program 1 times [2024-11-08 18:10:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:25,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847609397] [2024-11-08 18:10:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:25,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:25,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847609397] [2024-11-08 18:10:25,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847609397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:25,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:25,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893129240] [2024-11-08 18:10:25,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:26,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:26,001 INFO L87 Difference]: Start difference. First operand 393 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:26,069 INFO L93 Difference]: Finished difference Result 716 states and 1052 transitions. [2024-11-08 18:10:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-11-08 18:10:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:26,072 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:26,072 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:26,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:26,074 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 1041 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:26,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4716494845360826) internal successors, (571), 388 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions. [2024-11-08 18:10:26,085 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 122 [2024-11-08 18:10:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:26,085 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 577 transitions. [2024-11-08 18:10:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions. [2024-11-08 18:10:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 18:10:26,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:26,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:26,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:10:26,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:26,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 990395376, now seen corresponding path program 1 times [2024-11-08 18:10:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962078250] [2024-11-08 18:10:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:26,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:26,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962078250] [2024-11-08 18:10:26,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962078250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:26,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:26,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:26,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650493522] [2024-11-08 18:10:26,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:26,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:26,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:26,669 INFO L87 Difference]: Start difference. First operand 393 states and 577 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:26,795 INFO L93 Difference]: Finished difference Result 716 states and 1050 transitions. [2024-11-08 18:10:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-11-08 18:10:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:26,798 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:26,798 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:26,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-08 18:10:26,800 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 476 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:26,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1064 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4690721649484537) internal successors, (570), 388 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 576 transitions. [2024-11-08 18:10:26,817 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 576 transitions. Word has length 123 [2024-11-08 18:10:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:26,818 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 576 transitions. [2024-11-08 18:10:26,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 576 transitions. [2024-11-08 18:10:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 18:10:26,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:26,820 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:26,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:10:26,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1202028506, now seen corresponding path program 1 times [2024-11-08 18:10:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545394278] [2024-11-08 18:10:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:27,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:27,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545394278] [2024-11-08 18:10:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545394278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:27,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685700121] [2024-11-08 18:10:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:27,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:27,173 INFO L87 Difference]: Start difference. First operand 393 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:27,269 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-08 18:10:27,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:27,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-11-08 18:10:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:27,272 INFO L225 Difference]: With dead ends: 718 [2024-11-08 18:10:27,272 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:27,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-11-08 18:10:27,274 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 479 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:27,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1665 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4664948453608246) internal successors, (569), 388 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 575 transitions. [2024-11-08 18:10:27,285 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 575 transitions. Word has length 124 [2024-11-08 18:10:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:27,286 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 575 transitions. [2024-11-08 18:10:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 575 transitions. [2024-11-08 18:10:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 18:10:27,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:27,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:10:27,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 685921225, now seen corresponding path program 1 times [2024-11-08 18:10:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765596577] [2024-11-08 18:10:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765596577] [2024-11-08 18:10:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765596577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543213349] [2024-11-08 18:10:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:27,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:27,657 INFO L87 Difference]: Start difference. First operand 393 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:27,780 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2024-11-08 18:10:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-11-08 18:10:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:27,783 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:27,783 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:27,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:27,786 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 1024 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:27,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1064 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-11-08 18:10:27,800 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 125 [2024-11-08 18:10:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:27,800 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-11-08 18:10:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-11-08 18:10:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 18:10:27,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:27,802 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:10:27,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1133333018, now seen corresponding path program 1 times [2024-11-08 18:10:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825939070] [2024-11-08 18:10:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:28,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825939070] [2024-11-08 18:10:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825939070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314084344] [2024-11-08 18:10:28,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:28,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:28,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:28,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:28,147 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:28,258 INFO L93 Difference]: Finished difference Result 716 states and 1044 transitions. [2024-11-08 18:10:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-11-08 18:10:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:28,261 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:28,261 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:28,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:28,263 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 1016 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:28,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1064 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2024-11-08 18:10:28,274 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2024-11-08 18:10:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:28,275 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2024-11-08 18:10:28,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2024-11-08 18:10:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 18:10:28,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:28,277 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:10:28,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:28,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1944964062, now seen corresponding path program 1 times [2024-11-08 18:10:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:28,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082837808] [2024-11-08 18:10:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 18:10:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 18:10:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:28,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082837808] [2024-11-08 18:10:28,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082837808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:28,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:28,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084681512] [2024-11-08 18:10:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:28,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:28,724 INFO L87 Difference]: Start difference. First operand 393 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:28,786 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2024-11-08 18:10:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2024-11-08 18:10:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:28,789 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:28,789 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:28,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:28,791 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 518 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:28,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2024-11-08 18:10:28,802 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2024-11-08 18:10:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:28,802 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2024-11-08 18:10:28,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2024-11-08 18:10:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 18:10:28,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:28,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:28,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:10:28,804 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:28,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1181888200, now seen corresponding path program 1 times [2024-11-08 18:10:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:28,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441280920] [2024-11-08 18:10:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 18:10:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:10:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:29,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441280920] [2024-11-08 18:10:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441280920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:29,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:29,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:29,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034634248] [2024-11-08 18:10:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:29,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:29,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:29,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:29,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:29,374 INFO L87 Difference]: Start difference. First operand 393 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:29,487 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2024-11-08 18:10:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:29,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-11-08 18:10:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:29,490 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:29,490 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:29,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:29,492 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 473 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:29,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1062 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2024-11-08 18:10:29,504 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2024-11-08 18:10:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:29,505 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2024-11-08 18:10:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2024-11-08 18:10:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 18:10:29,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:29,507 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:29,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:10:29,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 988572428, now seen corresponding path program 1 times [2024-11-08 18:10:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:29,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577305159] [2024-11-08 18:10:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 18:10:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:10:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:30,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577305159] [2024-11-08 18:10:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577305159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:30,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:30,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806227263] [2024-11-08 18:10:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:30,029 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:30,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:30,165 INFO L93 Difference]: Finished difference Result 716 states and 1038 transitions. [2024-11-08 18:10:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:30,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2024-11-08 18:10:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:30,168 INFO L225 Difference]: With dead ends: 716 [2024-11-08 18:10:30,168 INFO L226 Difference]: Without dead ends: 393 [2024-11-08 18:10:30,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:30,170 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 469 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:30,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1069 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-08 18:10:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-08 18:10:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4536082474226804) internal successors, (564), 388 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2024-11-08 18:10:30,183 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 129 [2024-11-08 18:10:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2024-11-08 18:10:30,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2024-11-08 18:10:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 18:10:30,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:30,185 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:10:30,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 406852665, now seen corresponding path program 1 times [2024-11-08 18:10:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505054944] [2024-11-08 18:10:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 18:10:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:10:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505054944] [2024-11-08 18:10:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505054944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574748] [2024-11-08 18:10:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:30,944 INFO L87 Difference]: Start difference. First operand 393 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:31,198 INFO L93 Difference]: Finished difference Result 722 states and 1044 transitions. [2024-11-08 18:10:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-11-08 18:10:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:31,203 INFO L225 Difference]: With dead ends: 722 [2024-11-08 18:10:31,203 INFO L226 Difference]: Without dead ends: 397 [2024-11-08 18:10:31,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:31,205 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:31,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2087 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:10:31,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-08 18:10:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-08 18:10:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2024-11-08 18:10:31,218 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2024-11-08 18:10:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:31,218 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2024-11-08 18:10:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2024-11-08 18:10:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 18:10:31,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:31,220 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:31,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:10:31,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:31,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1709410096, now seen corresponding path program 1 times [2024-11-08 18:10:31,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:31,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888917663] [2024-11-08 18:10:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 18:10:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:10:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888917663] [2024-11-08 18:10:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888917663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:31,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:31,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971876906] [2024-11-08 18:10:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:31,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:31,719 INFO L87 Difference]: Start difference. First operand 395 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:31,835 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-08 18:10:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:31,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-11-08 18:10:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:31,838 INFO L225 Difference]: With dead ends: 720 [2024-11-08 18:10:31,838 INFO L226 Difference]: Without dead ends: 395 [2024-11-08 18:10:31,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:31,841 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 926 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:31,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1062 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-08 18:10:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-08 18:10:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-08 18:10:31,852 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2024-11-08 18:10:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:31,853 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-08 18:10:31,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-08 18:10:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 18:10:31,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:31,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:10:31,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -815191116, now seen corresponding path program 1 times [2024-11-08 18:10:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262920838] [2024-11-08 18:10:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 18:10:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 18:10:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262920838] [2024-11-08 18:10:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262920838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:32,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:32,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500427212] [2024-11-08 18:10:32,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:32,174 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:32,261 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2024-11-08 18:10:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:32,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 132 [2024-11-08 18:10:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:32,264 INFO L225 Difference]: With dead ends: 720 [2024-11-08 18:10:32,264 INFO L226 Difference]: Without dead ends: 395 [2024-11-08 18:10:32,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:32,265 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 513 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:32,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-08 18:10:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-08 18:10:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2024-11-08 18:10:32,278 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2024-11-08 18:10:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:32,279 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2024-11-08 18:10:32,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 18:10:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2024-11-08 18:10:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 18:10:32,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:32,281 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:32,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:10:32,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:32,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1900448443, now seen corresponding path program 1 times [2024-11-08 18:10:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088247269] [2024-11-08 18:10:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:10:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:10:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088247269] [2024-11-08 18:10:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088247269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761087086] [2024-11-08 18:10:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:33,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:33,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:33,046 INFO L87 Difference]: Start difference. First operand 395 states and 570 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:33,097 INFO L93 Difference]: Finished difference Result 766 states and 1093 transitions. [2024-11-08 18:10:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-11-08 18:10:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:33,101 INFO L225 Difference]: With dead ends: 766 [2024-11-08 18:10:33,101 INFO L226 Difference]: Without dead ends: 441 [2024-11-08 18:10:33,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:33,102 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 19 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-08 18:10:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-08 18:10:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.4216589861751152) internal successors, (617), 434 states have internal predecessors, (617), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2024-11-08 18:10:33,116 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 133 [2024-11-08 18:10:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:33,117 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2024-11-08 18:10:33,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2024-11-08 18:10:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 18:10:33,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:33,118 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:33,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:10:33,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -306752993, now seen corresponding path program 1 times [2024-11-08 18:10:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452933714] [2024-11-08 18:10:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 18:10:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 18:10:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 18:10:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452933714] [2024-11-08 18:10:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452933714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:33,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:10:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719518537] [2024-11-08 18:10:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:10:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:10:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:33,897 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:34,205 INFO L93 Difference]: Finished difference Result 886 states and 1253 transitions. [2024-11-08 18:10:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:10:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-11-08 18:10:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:34,208 INFO L225 Difference]: With dead ends: 886 [2024-11-08 18:10:34,208 INFO L226 Difference]: Without dead ends: 443 [2024-11-08 18:10:34,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:10:34,210 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 646 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:34,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2562 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:10:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-08 18:10:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-11-08 18:10:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 436 states have (on average 1.4174311926605505) internal successors, (618), 436 states have internal predecessors, (618), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 18:10:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 624 transitions. [2024-11-08 18:10:34,223 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 624 transitions. Word has length 134 [2024-11-08 18:10:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:34,223 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 624 transitions. [2024-11-08 18:10:34,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 624 transitions. [2024-11-08 18:10:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 18:10:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:34,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:10:34,226 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:34,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1457685238, now seen corresponding path program 1 times [2024-11-08 18:10:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368659734] [2024-11-08 18:10:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:35,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 18:10:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368659734] [2024-11-08 18:10:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368659734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:10:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386434975] [2024-11-08 18:10:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:35,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:10:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:35,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:10:35,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:35,093 INFO L87 Difference]: Start difference. First operand 441 states and 624 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:35,218 INFO L93 Difference]: Finished difference Result 980 states and 1367 transitions. [2024-11-08 18:10:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:10:35,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2024-11-08 18:10:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:35,221 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:35,222 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:35,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:10:35,223 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 857 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:35,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2198 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3876871880199668) internal successors, (834), 601 states have internal predecessors, (834), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 846 transitions. [2024-11-08 18:10:35,244 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 846 transitions. Word has length 135 [2024-11-08 18:10:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:35,245 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 846 transitions. [2024-11-08 18:10:35,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 846 transitions. [2024-11-08 18:10:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 18:10:35,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:35,249 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:10:35,249 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:35,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2091908698, now seen corresponding path program 1 times [2024-11-08 18:10:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:35,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091517059] [2024-11-08 18:10:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 18:10:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-08 18:10:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 18:10:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:36,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:36,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091517059] [2024-11-08 18:10:36,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091517059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458598611] [2024-11-08 18:10:36,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:36,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:36,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:36,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:36,047 INFO L87 Difference]: Start difference. First operand 609 states and 846 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:36,140 INFO L93 Difference]: Finished difference Result 980 states and 1366 transitions. [2024-11-08 18:10:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-11-08 18:10:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:36,143 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:36,144 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:36,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:36,146 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 936 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:36,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1058 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3860232945091515) internal successors, (833), 601 states have internal predecessors, (833), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 845 transitions. [2024-11-08 18:10:36,169 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 845 transitions. Word has length 324 [2024-11-08 18:10:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:36,170 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 845 transitions. [2024-11-08 18:10:36,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 845 transitions. [2024-11-08 18:10:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-08 18:10:36,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:36,175 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:36,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:10:36,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:36,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -722514356, now seen corresponding path program 1 times [2024-11-08 18:10:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:36,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645449072] [2024-11-08 18:10:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-08 18:10:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-08 18:10:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 18:10:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645449072] [2024-11-08 18:10:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645449072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:36,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:36,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284185110] [2024-11-08 18:10:36,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:36,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:36,965 INFO L87 Difference]: Start difference. First operand 609 states and 845 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:37,061 INFO L93 Difference]: Finished difference Result 980 states and 1364 transitions. [2024-11-08 18:10:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:37,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-11-08 18:10:37,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:37,066 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:37,066 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:37,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:37,067 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 506 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:37,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1065 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3843594009983362) internal successors, (832), 601 states have internal predecessors, (832), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 844 transitions. [2024-11-08 18:10:37,088 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 844 transitions. Word has length 325 [2024-11-08 18:10:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:37,088 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 844 transitions. [2024-11-08 18:10:37,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 844 transitions. [2024-11-08 18:10:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-08 18:10:37,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:37,093 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:37,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:10:37,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1951186673, now seen corresponding path program 1 times [2024-11-08 18:10:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836316053] [2024-11-08 18:10:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-08 18:10:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-08 18:10:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-08 18:10:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836316053] [2024-11-08 18:10:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836316053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:37,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208405048] [2024-11-08 18:10:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:37,913 INFO L87 Difference]: Start difference. First operand 609 states and 844 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:38,004 INFO L93 Difference]: Finished difference Result 980 states and 1362 transitions. [2024-11-08 18:10:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-11-08 18:10:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:38,008 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:38,008 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:38,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:38,009 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 904 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:38,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1058 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.382695507487521) internal successors, (831), 601 states have internal predecessors, (831), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 843 transitions. [2024-11-08 18:10:38,027 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 843 transitions. Word has length 326 [2024-11-08 18:10:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:38,028 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 843 transitions. [2024-11-08 18:10:38,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 843 transitions. [2024-11-08 18:10:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-08 18:10:38,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:38,032 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:38,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:10:38,033 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:38,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:38,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1071864095, now seen corresponding path program 1 times [2024-11-08 18:10:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903917497] [2024-11-08 18:10:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-08 18:10:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 18:10:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 18:10:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903917497] [2024-11-08 18:10:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903917497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302034779] [2024-11-08 18:10:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:38,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:38,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:38,882 INFO L87 Difference]: Start difference. First operand 609 states and 843 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:38,993 INFO L93 Difference]: Finished difference Result 980 states and 1360 transitions. [2024-11-08 18:10:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-11-08 18:10:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:38,998 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:38,998 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:38,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:39,000 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 490 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:39,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1065 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3810316139767056) internal successors, (830), 601 states have internal predecessors, (830), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 842 transitions. [2024-11-08 18:10:39,022 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 842 transitions. Word has length 327 [2024-11-08 18:10:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 842 transitions. [2024-11-08 18:10:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 842 transitions. [2024-11-08 18:10:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-08 18:10:39,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:39,028 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:10:39,029 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:39,029 INFO L85 PathProgramCache]: Analyzing trace with hash 437028676, now seen corresponding path program 1 times [2024-11-08 18:10:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239482009] [2024-11-08 18:10:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-08 18:10:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-08 18:10:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-08 18:10:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:39,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:39,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239482009] [2024-11-08 18:10:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239482009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382118941] [2024-11-08 18:10:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:39,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:39,901 INFO L87 Difference]: Start difference. First operand 609 states and 842 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:39,970 INFO L93 Difference]: Finished difference Result 980 states and 1358 transitions. [2024-11-08 18:10:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-11-08 18:10:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:39,974 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:39,974 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:39,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:39,976 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 475 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:39,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1089 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3793677204658903) internal successors, (829), 601 states have internal predecessors, (829), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 841 transitions. [2024-11-08 18:10:39,993 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 841 transitions. Word has length 328 [2024-11-08 18:10:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:39,994 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 841 transitions. [2024-11-08 18:10:39,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 841 transitions. [2024-11-08 18:10:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-08 18:10:39,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:39,998 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:39,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:10:39,999 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -825845002, now seen corresponding path program 1 times [2024-11-08 18:10:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:40,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707565789] [2024-11-08 18:10:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 18:10:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 18:10:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-08 18:10:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:40,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707565789] [2024-11-08 18:10:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707565789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491789472] [2024-11-08 18:10:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:40,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:40,844 INFO L87 Difference]: Start difference. First operand 609 states and 841 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:40,913 INFO L93 Difference]: Finished difference Result 980 states and 1356 transitions. [2024-11-08 18:10:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:40,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-11-08 18:10:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:40,921 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:40,922 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:40,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:40,924 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 849 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:40,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1082 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.377703826955075) internal successors, (828), 601 states have internal predecessors, (828), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 840 transitions. [2024-11-08 18:10:40,941 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 840 transitions. Word has length 329 [2024-11-08 18:10:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:40,942 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 840 transitions. [2024-11-08 18:10:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 840 transitions. [2024-11-08 18:10:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-08 18:10:40,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:40,950 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:40,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:10:40,951 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:40,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:40,951 INFO L85 PathProgramCache]: Analyzing trace with hash -174190343, now seen corresponding path program 1 times [2024-11-08 18:10:40,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:40,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066192726] [2024-11-08 18:10:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-08 18:10:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-08 18:10:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-08 18:10:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066192726] [2024-11-08 18:10:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066192726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:41,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539247514] [2024-11-08 18:10:41,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:41,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:41,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:41,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:41,789 INFO L87 Difference]: Start difference. First operand 609 states and 840 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:42,075 INFO L93 Difference]: Finished difference Result 980 states and 1354 transitions. [2024-11-08 18:10:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-11-08 18:10:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:42,079 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:42,080 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:42,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:42,081 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 789 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:42,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 802 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:10:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3760399334442597) internal successors, (827), 601 states have internal predecessors, (827), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 839 transitions. [2024-11-08 18:10:42,101 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 839 transitions. Word has length 330 [2024-11-08 18:10:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:42,102 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 839 transitions. [2024-11-08 18:10:42,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 839 transitions. [2024-11-08 18:10:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-08 18:10:42,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:42,107 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:42,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:10:42,108 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:42,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1306618507, now seen corresponding path program 1 times [2024-11-08 18:10:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:42,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151228981] [2024-11-08 18:10:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:42,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-08 18:10:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-08 18:10:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-08 18:10:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151228981] [2024-11-08 18:10:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151228981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:43,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289309792] [2024-11-08 18:10:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:43,550 INFO L87 Difference]: Start difference. First operand 609 states and 839 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:43,614 INFO L93 Difference]: Finished difference Result 980 states and 1352 transitions. [2024-11-08 18:10:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-11-08 18:10:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:43,618 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:43,618 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:43,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:43,619 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 381 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:43,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1080 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3743760399334441) internal successors, (826), 601 states have internal predecessors, (826), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 838 transitions. [2024-11-08 18:10:43,636 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 838 transitions. Word has length 331 [2024-11-08 18:10:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:43,637 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 838 transitions. [2024-11-08 18:10:43,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 838 transitions. [2024-11-08 18:10:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-08 18:10:43,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:43,639 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:10:43,640 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:43,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 84549355, now seen corresponding path program 1 times [2024-11-08 18:10:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278339187] [2024-11-08 18:10:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:43,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-08 18:10:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-08 18:10:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-08 18:10:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278339187] [2024-11-08 18:10:45,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278339187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511713034] [2024-11-08 18:10:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:45,019 INFO L87 Difference]: Start difference. First operand 609 states and 838 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:45,123 INFO L93 Difference]: Finished difference Result 980 states and 1350 transitions. [2024-11-08 18:10:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-11-08 18:10:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:45,131 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:45,131 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:45,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-11-08 18:10:45,136 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 861 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:45,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1050 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3727121464226288) internal successors, (825), 601 states have internal predecessors, (825), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 837 transitions. [2024-11-08 18:10:45,154 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 837 transitions. Word has length 332 [2024-11-08 18:10:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:45,154 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 837 transitions. [2024-11-08 18:10:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 837 transitions. [2024-11-08 18:10:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-08 18:10:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:45,157 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:45,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 18:10:45,158 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:45,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1221638347, now seen corresponding path program 1 times [2024-11-08 18:10:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739275076] [2024-11-08 18:10:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-08 18:10:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-08 18:10:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 18:10:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739275076] [2024-11-08 18:10:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739275076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28562680] [2024-11-08 18:10:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:46,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:46,322 INFO L87 Difference]: Start difference. First operand 609 states and 837 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:46,419 INFO L93 Difference]: Finished difference Result 980 states and 1348 transitions. [2024-11-08 18:10:46,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:46,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-11-08 18:10:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:46,422 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:46,422 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:46,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-11-08 18:10:46,423 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 453 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:46,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1057 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3710482529118135) internal successors, (824), 601 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 836 transitions. [2024-11-08 18:10:46,438 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 836 transitions. Word has length 333 [2024-11-08 18:10:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:46,438 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 836 transitions. [2024-11-08 18:10:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 836 transitions. [2024-11-08 18:10:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-08 18:10:46,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:46,441 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 18:10:46,441 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:46,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1872351418, now seen corresponding path program 1 times [2024-11-08 18:10:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088229206] [2024-11-08 18:10:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-08 18:10:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-08 18:10:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-08 18:10:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088229206] [2024-11-08 18:10:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088229206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429685166] [2024-11-08 18:10:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:47,464 INFO L87 Difference]: Start difference. First operand 609 states and 836 transitions. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:47,567 INFO L93 Difference]: Finished difference Result 980 states and 1346 transitions. [2024-11-08 18:10:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-11-08 18:10:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:47,571 INFO L225 Difference]: With dead ends: 980 [2024-11-08 18:10:47,571 INFO L226 Difference]: Without dead ends: 609 [2024-11-08 18:10:47,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-11-08 18:10:47,573 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 452 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:47,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1057 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-08 18:10:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-08 18:10:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3693843594009982) internal successors, (823), 601 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 18:10:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 835 transitions. [2024-11-08 18:10:47,590 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 835 transitions. Word has length 334 [2024-11-08 18:10:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:47,591 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 835 transitions. [2024-11-08 18:10:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 835 transitions. [2024-11-08 18:10:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-08 18:10:47,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:47,594 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:47,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 18:10:47,595 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2098226244, now seen corresponding path program 1 times [2024-11-08 18:10:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787887956] [2024-11-08 18:10:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:47,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-08 18:10:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-08 18:10:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-08 18:10:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:48,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787887956] [2024-11-08 18:10:48,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787887956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:48,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:48,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:10:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004288448] [2024-11-08 18:10:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:48,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:10:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:10:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:48,960 INFO L87 Difference]: Start difference. First operand 609 states and 835 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:49,325 INFO L93 Difference]: Finished difference Result 1429 states and 1965 transitions. [2024-11-08 18:10:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:10:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-11-08 18:10:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:49,330 INFO L225 Difference]: With dead ends: 1429 [2024-11-08 18:10:49,330 INFO L226 Difference]: Without dead ends: 1058 [2024-11-08 18:10:49,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:49,332 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 591 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:49,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1968 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:10:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-08 18:10:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 936. [2024-11-08 18:10:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3654054054054054) internal successors, (1263), 925 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 18:10:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1281 transitions. [2024-11-08 18:10:49,358 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1281 transitions. Word has length 335 [2024-11-08 18:10:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1281 transitions. [2024-11-08 18:10:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1281 transitions. [2024-11-08 18:10:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 18:10:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:49,361 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 18:10:49,362 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1248794528, now seen corresponding path program 1 times [2024-11-08 18:10:49,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268826732] [2024-11-08 18:10:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-08 18:10:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 18:10:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-08 18:10:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:10:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268826732] [2024-11-08 18:10:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268826732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:51,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:51,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:10:51,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138183034] [2024-11-08 18:10:51,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:51,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:10:51,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:51,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:10:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:10:51,097 INFO L87 Difference]: Start difference. First operand 936 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:51,634 INFO L93 Difference]: Finished difference Result 1330 states and 1824 transitions. [2024-11-08 18:10:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:10:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-08 18:10:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:51,639 INFO L225 Difference]: With dead ends: 1330 [2024-11-08 18:10:51,639 INFO L226 Difference]: Without dead ends: 959 [2024-11-08 18:10:51,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:51,641 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 766 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:51,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1579 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:10:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-08 18:10:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 937. [2024-11-08 18:10:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3650107991360692) internal successors, (1264), 926 states have internal predecessors, (1264), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 18:10:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1282 transitions. [2024-11-08 18:10:51,673 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1282 transitions. Word has length 336 [2024-11-08 18:10:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:51,673 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1282 transitions. [2024-11-08 18:10:51,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1282 transitions. [2024-11-08 18:10:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-08 18:10:51,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:51,679 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 18:10:51,680 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash 214777389, now seen corresponding path program 1 times [2024-11-08 18:10:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949036625] [2024-11-08 18:10:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:10:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:10:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:10:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-08 18:10:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 18:10:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-08 18:10:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 18:10:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949036625] [2024-11-08 18:10:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949036625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:10:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45705348] [2024-11-08 18:10:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:53,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:10:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:53,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:10:53,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:10:53,603 INFO L87 Difference]: Start difference. First operand 937 states and 1282 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:54,815 INFO L93 Difference]: Finished difference Result 2112 states and 2883 transitions. [2024-11-08 18:10:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:10:54,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-08 18:10:54,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:54,823 INFO L225 Difference]: With dead ends: 2112 [2024-11-08 18:10:54,823 INFO L226 Difference]: Without dead ends: 1625 [2024-11-08 18:10:54,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:10:54,826 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 1362 mSDsluCounter, 3404 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:54,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4322 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 18:10:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-08 18:10:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1006. [2024-11-08 18:10:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 992 states have (on average 1.3669354838709677) internal successors, (1356), 992 states have internal predecessors, (1356), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 18:10:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1380 transitions. [2024-11-08 18:10:54,870 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1380 transitions. Word has length 336 [2024-11-08 18:10:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1380 transitions. [2024-11-08 18:10:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1380 transitions. [2024-11-08 18:10:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-08 18:10:54,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:54,877 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:54,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 18:10:54,879 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 401373631, now seen corresponding path program 1 times [2024-11-08 18:10:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:54,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956427953] [2024-11-08 18:10:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 18:10:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 18:10:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-08 18:10:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 18:10:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:56,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956427953] [2024-11-08 18:10:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956427953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:10:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996635005] [2024-11-08 18:10:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:56,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:10:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:10:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:56,615 INFO L87 Difference]: Start difference. First operand 1006 states and 1380 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:56,912 INFO L93 Difference]: Finished difference Result 1672 states and 2269 transitions. [2024-11-08 18:10:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:10:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2024-11-08 18:10:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:56,917 INFO L225 Difference]: With dead ends: 1672 [2024-11-08 18:10:56,917 INFO L226 Difference]: Without dead ends: 1018 [2024-11-08 18:10:56,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11-08 18:10:56,919 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 323 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:56,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1188 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:10:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-08 18:10:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1012. [2024-11-08 18:10:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3647294589178356) internal successors, (1362), 998 states have internal predecessors, (1362), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 18:10:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1386 transitions. [2024-11-08 18:10:56,946 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1386 transitions. Word has length 337 [2024-11-08 18:10:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:56,947 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1386 transitions. [2024-11-08 18:10:56,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 18:10:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1386 transitions. [2024-11-08 18:10:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-08 18:10:56,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:56,950 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:56,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 18:10:56,950 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1255397875, now seen corresponding path program 1 times [2024-11-08 18:10:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925459165] [2024-11-08 18:10:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 18:10:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 18:10:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-08 18:10:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 18:10:57,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:57,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925459165] [2024-11-08 18:10:57,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925459165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618092640] [2024-11-08 18:10:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:57,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:57,986 INFO L87 Difference]: Start difference. First operand 1012 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:58,263 INFO L93 Difference]: Finished difference Result 1668 states and 2259 transitions. [2024-11-08 18:10:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-11-08 18:10:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:58,268 INFO L225 Difference]: With dead ends: 1668 [2024-11-08 18:10:58,268 INFO L226 Difference]: Without dead ends: 1012 [2024-11-08 18:10:58,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:58,270 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 501 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:58,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 807 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:10:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-08 18:10:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-11-08 18:10:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3587174348697395) internal successors, (1356), 998 states have internal predecessors, (1356), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 18:10:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1380 transitions. [2024-11-08 18:10:58,303 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1380 transitions. Word has length 337 [2024-11-08 18:10:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:58,303 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1380 transitions. [2024-11-08 18:10:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:10:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1380 transitions. [2024-11-08 18:10:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-08 18:10:58,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:58,307 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:58,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 18:10:58,307 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:58,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1921807987, now seen corresponding path program 1 times [2024-11-08 18:10:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545866140] [2024-11-08 18:10:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:10:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:10:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:10:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 18:10:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-08 18:10:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-08 18:10:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 18:10:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:59,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545866140] [2024-11-08 18:10:59,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545866140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:59,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:10:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585091473] [2024-11-08 18:10:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:59,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:10:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:10:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:10:59,922 INFO L87 Difference]: Start difference. First operand 1012 states and 1380 transitions. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:11:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:00,650 INFO L93 Difference]: Finished difference Result 2518 states and 3403 transitions. [2024-11-08 18:11:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:11:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-08 18:11:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:00,658 INFO L225 Difference]: With dead ends: 2518 [2024-11-08 18:11:00,658 INFO L226 Difference]: Without dead ends: 1878 [2024-11-08 18:11:00,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:11:00,663 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1289 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:00,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2402 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:11:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2024-11-08 18:11:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1870. [2024-11-08 18:11:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1844 states have (on average 1.3503253796095445) internal successors, (2490), 1844 states have internal predecessors, (2490), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 18:11:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2538 transitions. [2024-11-08 18:11:00,717 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2538 transitions. Word has length 339 [2024-11-08 18:11:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:00,718 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2538 transitions. [2024-11-08 18:11:00,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:11:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2538 transitions. [2024-11-08 18:11:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-08 18:11:00,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:00,723 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:00,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 18:11:00,724 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2080700861, now seen corresponding path program 1 times [2024-11-08 18:11:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874004931] [2024-11-08 18:11:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:11:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 18:11:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:11:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-08 18:11:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 18:11:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-08 18:11:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 18:11:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874004931] [2024-11-08 18:11:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874004931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:11:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303229904] [2024-11-08 18:11:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:11:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:11:02,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:11:02,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:11:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:03,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:11:03,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:11:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-08 18:11:03,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:11:03,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303229904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:11:03,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:11:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-08 18:11:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094127408] [2024-11-08 18:11:03,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:11:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:11:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:11:03,574 INFO L87 Difference]: Start difference. First operand 1870 states and 2538 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:11:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:03,863 INFO L93 Difference]: Finished difference Result 2599 states and 3514 transitions. [2024-11-08 18:11:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:11:03,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 341 [2024-11-08 18:11:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:03,867 INFO L225 Difference]: With dead ends: 2599 [2024-11-08 18:11:03,867 INFO L226 Difference]: Without dead ends: 1010 [2024-11-08 18:11:03,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:11:03,870 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 458 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:03,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 794 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:11:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-08 18:11:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2024-11-08 18:11:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 996 states have (on average 1.3534136546184738) internal successors, (1348), 996 states have internal predecessors, (1348), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 18:11:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1372 transitions. [2024-11-08 18:11:03,896 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1372 transitions. Word has length 341 [2024-11-08 18:11:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:03,897 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1372 transitions. [2024-11-08 18:11:03,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-08 18:11:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1372 transitions. [2024-11-08 18:11:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-08 18:11:03,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:03,900 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:03,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 18:11:04,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-08 18:11:04,101 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:04,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1578736179, now seen corresponding path program 1 times [2024-11-08 18:11:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:04,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504049360] [2024-11-08 18:11:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:11:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:11:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 18:11:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-08 18:11:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-08 18:11:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-08 18:11:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-08 18:11:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504049360] [2024-11-08 18:11:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504049360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:11:06,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:11:06,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:11:06,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157883787] [2024-11-08 18:11:06,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:06,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:11:06,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:11:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:11:06,230 INFO L87 Difference]: Start difference. First operand 1010 states and 1372 transitions. Second operand has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:11:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:07,055 INFO L93 Difference]: Finished difference Result 2457 states and 3296 transitions. [2024-11-08 18:11:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:11:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 341 [2024-11-08 18:11:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:07,066 INFO L225 Difference]: With dead ends: 2457 [2024-11-08 18:11:07,066 INFO L226 Difference]: Without dead ends: 1746 [2024-11-08 18:11:07,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:11:07,069 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 2136 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:07,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 3382 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:11:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-08 18:11:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1126. [2024-11-08 18:11:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1108 states have (on average 1.364620938628159) internal successors, (1512), 1108 states have internal predecessors, (1512), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:11:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1544 transitions. [2024-11-08 18:11:07,107 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1544 transitions. Word has length 341 [2024-11-08 18:11:07,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:07,107 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1544 transitions. [2024-11-08 18:11:07,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:11:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1544 transitions. [2024-11-08 18:11:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-08 18:11:07,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:07,111 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 18:11:07,111 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 675720909, now seen corresponding path program 1 times [2024-11-08 18:11:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690155986] [2024-11-08 18:11:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:11:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:11:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 18:11:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-08 18:11:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-08 18:11:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-08 18:11:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-08 18:11:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690155986] [2024-11-08 18:11:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690155986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:11:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:11:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:11:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201342082] [2024-11-08 18:11:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:11:08,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:11:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:11:08,462 INFO L87 Difference]: Start difference. First operand 1126 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:11:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:08,922 INFO L93 Difference]: Finished difference Result 2071 states and 2832 transitions. [2024-11-08 18:11:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:11:08,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 343 [2024-11-08 18:11:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:08,927 INFO L225 Difference]: With dead ends: 2071 [2024-11-08 18:11:08,927 INFO L226 Difference]: Without dead ends: 1142 [2024-11-08 18:11:08,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:11:08,929 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 536 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:08,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1560 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:11:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-08 18:11:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1134. [2024-11-08 18:11:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1116 states have (on average 1.3584229390681004) internal successors, (1516), 1116 states have internal predecessors, (1516), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:11:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1548 transitions. [2024-11-08 18:11:08,958 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1548 transitions. Word has length 343 [2024-11-08 18:11:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:08,959 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1548 transitions. [2024-11-08 18:11:08,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:11:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1548 transitions. [2024-11-08 18:11:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-08 18:11:08,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:08,962 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:08,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 18:11:08,963 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:08,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:08,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1280165033, now seen corresponding path program 1 times [2024-11-08 18:11:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971298334] [2024-11-08 18:11:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:11:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 18:11:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 18:11:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-08 18:11:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-08 18:11:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-08 18:11:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-08 18:11:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:10,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971298334] [2024-11-08 18:11:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971298334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:11:10,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:11:10,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:11:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021571764] [2024-11-08 18:11:10,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:10,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:11:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:10,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:11:10,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:11:10,387 INFO L87 Difference]: Start difference. First operand 1134 states and 1548 transitions. Second operand has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:11:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:10,817 INFO L93 Difference]: Finished difference Result 2061 states and 2807 transitions. [2024-11-08 18:11:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:11:10,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 345 [2024-11-08 18:11:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:10,820 INFO L225 Difference]: With dead ends: 2061 [2024-11-08 18:11:10,820 INFO L226 Difference]: Without dead ends: 1142 [2024-11-08 18:11:10,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:11:10,822 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 495 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:10,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1553 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:11:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-08 18:11:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1138. [2024-11-08 18:11:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1120 states have (on average 1.3571428571428572) internal successors, (1520), 1120 states have internal predecessors, (1520), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:11:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1552 transitions. [2024-11-08 18:11:10,850 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1552 transitions. Word has length 345 [2024-11-08 18:11:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:10,850 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1552 transitions. [2024-11-08 18:11:10,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 18:11:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1552 transitions. [2024-11-08 18:11:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 18:11:10,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:10,855 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:10,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 18:11:10,855 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:10,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -240678099, now seen corresponding path program 1 times [2024-11-08 18:11:10,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:10,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754413045] [2024-11-08 18:11:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:10,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:11:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 18:11:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 18:11:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 18:11:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 18:11:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-08 18:11:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 18:11:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754413045] [2024-11-08 18:11:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754413045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:11:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574244916] [2024-11-08 18:11:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:12,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:11:12,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:11:12,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:11:12,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:11:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:13,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 18:11:13,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:11:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 18:11:14,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:11:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-08 18:11:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574244916] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 18:11:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:11:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2024-11-08 18:11:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255681642] [2024-11-08 18:11:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:14,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 18:11:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:14,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 18:11:14,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:11:14,940 INFO L87 Difference]: Start difference. First operand 1138 states and 1552 transitions. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 18:11:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:15,327 INFO L93 Difference]: Finished difference Result 2009 states and 2729 transitions. [2024-11-08 18:11:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:11:15,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 347 [2024-11-08 18:11:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:15,332 INFO L225 Difference]: With dead ends: 2009 [2024-11-08 18:11:15,333 INFO L226 Difference]: Without dead ends: 1170 [2024-11-08 18:11:15,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:11:15,335 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1074 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:15,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1563 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:11:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-08 18:11:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2024-11-08 18:11:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1152 states have (on average 1.3576388888888888) internal successors, (1564), 1152 states have internal predecessors, (1564), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 18:11:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1596 transitions. [2024-11-08 18:11:15,377 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1596 transitions. Word has length 347 [2024-11-08 18:11:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1596 transitions. [2024-11-08 18:11:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 18:11:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1596 transitions. [2024-11-08 18:11:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 18:11:15,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:15,381 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:15,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:11:15,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-11-08 18:11:15,583 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -167980851, now seen corresponding path program 1 times [2024-11-08 18:11:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927815927] [2024-11-08 18:11:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 18:11:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 18:11:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 18:11:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 18:11:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 18:11:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-08 18:11:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:11:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 18:11:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:11:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927815927] [2024-11-08 18:11:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927815927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:11:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:11:18,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:11:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386425940] [2024-11-08 18:11:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:11:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:11:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:11:18,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:11:18,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:11:18,643 INFO L87 Difference]: Start difference. First operand 1170 states and 1596 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:11:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:11:19,046 INFO L93 Difference]: Finished difference Result 2207 states and 2999 transitions. [2024-11-08 18:11:19,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:11:19,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 347 [2024-11-08 18:11:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:11:19,050 INFO L225 Difference]: With dead ends: 2207 [2024-11-08 18:11:19,050 INFO L226 Difference]: Without dead ends: 1538 [2024-11-08 18:11:19,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-08 18:11:19,052 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 1246 mSDsluCounter, 5173 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:11:19,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 6015 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:11:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-08 18:11:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1235. [2024-11-08 18:11:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1214 states have (on average 1.3599670510708401) internal successors, (1651), 1214 states have internal predecessors, (1651), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 18:11:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1689 transitions. [2024-11-08 18:11:19,092 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1689 transitions. Word has length 347 [2024-11-08 18:11:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:11:19,093 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1689 transitions. [2024-11-08 18:11:19,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 18:11:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1689 transitions. [2024-11-08 18:11:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-08 18:11:19,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:11:19,097 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:11:19,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 18:11:19,097 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:11:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:11:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1056061037, now seen corresponding path program 1 times [2024-11-08 18:11:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:11:19,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72177695] [2024-11-08 18:11:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:11:19,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:11:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat