./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_w8_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 892a8506f942e825df8a32caf9cdaec45fd7cb5b4dbda5bc8acf67b64cc58b84 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:51:17,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:51:17,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:51:17,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:51:17,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:51:17,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:51:17,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:51:17,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:51:17,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:51:17,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:51:17,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:51:17,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:51:17,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:51:17,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:51:17,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:51:17,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:51:17,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:51:17,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:51:17,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:51:17,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:51:17,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:51:17,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:51:17,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:51:17,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:51:17,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:51:17,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:51:17,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:51:17,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:51:17,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:51:17,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:51:17,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:51:17,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:51:17,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:51:17,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:51:17,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:51:17,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:51:17,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:51:17,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:51:17,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:51:17,118 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 -> 892a8506f942e825df8a32caf9cdaec45fd7cb5b4dbda5bc8acf67b64cc58b84 [2024-11-16 10:51:17,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:51:17,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:51:17,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:51:17,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:51:17,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:51:17,384 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_w8_d8_e0.c [2024-11-16 10:51:18,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:51:18,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:51:18,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2024-11-16 10:51:18,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4ba8c03/c2434565b4ae4fc283ce5f4be93c30a7/FLAG8bede0754 [2024-11-16 10:51:19,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d4ba8c03/c2434565b4ae4fc283ce5f4be93c30a7 [2024-11-16 10:51:19,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:51:19,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:51:19,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:51:19,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:51:19,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:51:19,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6f643b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19, skipping insertion in model container [2024-11-16 10:51:19,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:51:19,511 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_w8_d8_e0.c[1278,1291] [2024-11-16 10:51:19,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:51:19,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:51:19,655 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_w8_d8_e0.c[1278,1291] [2024-11-16 10:51:19,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:51:19,754 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:51:19,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19 WrapperNode [2024-11-16 10:51:19,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:51:19,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:51:19,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:51:19,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:51:19,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,886 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2024-11-16 10:51:19,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:51:19,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:51:19,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:51:19,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:51:19,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:19,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,070 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-16 10:51:20,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:51:20,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:51:20,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:51:20,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:51:20,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (1/1) ... [2024-11-16 10:51:20,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:51:20,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:51:20,211 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-16 10:51:20,213 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-16 10:51:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:51:20,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 10:51:20,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 10:51:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:51:20,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:51:20,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:51:20,437 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:51:20,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:51:21,720 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-16 10:51:21,720 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:51:21,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:51:21,775 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:51:21,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:51:21 BoogieIcfgContainer [2024-11-16 10:51:21,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:51:21,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:51:21,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:51:21,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:51:21,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:51:19" (1/3) ... [2024-11-16 10:51:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1f4bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:51:21, skipping insertion in model container [2024-11-16 10:51:21,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:51:19" (2/3) ... [2024-11-16 10:51:21,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1f4bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:51:21, skipping insertion in model container [2024-11-16 10:51:21,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:51:21" (3/3) ... [2024-11-16 10:51:21,783 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w8_d8_e0.c [2024-11-16 10:51:21,796 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:51:21,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:51:21,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:51:21,863 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;@1828d51f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:51:21,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:51:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 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-16 10:51:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:51:21,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:21,879 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-16 10:51:21,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:21,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1130703786, now seen corresponding path program 1 times [2024-11-16 10:51:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:21,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744944338] [2024-11-16 10:51:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:22,296 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-16 10:51:22,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744944338] [2024-11-16 10:51:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744944338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:22,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 10:51:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845201408] [2024-11-16 10:51:22,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 10:51:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 10:51:22,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 10:51:22,327 INFO L87 Difference]: Start difference. First operand has 395 states, 389 states have (on average 1.4884318766066837) internal successors, (579), 390 states have internal predecessors, (579), 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 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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-16 10:51:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:22,460 INFO L93 Difference]: Finished difference Result 715 states and 1065 transitions. [2024-11-16 10:51:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 10:51:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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 118 [2024-11-16 10:51:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:22,470 INFO L225 Difference]: With dead ends: 715 [2024-11-16 10:51:22,471 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 10:51:22,474 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-16 10:51:22,476 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:22,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:51:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 10:51:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-11-16 10:51:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 10:51:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-11-16 10:51:22,537 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 118 [2024-11-16 10:51:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:22,538 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-11-16 10:51:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 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-16 10:51:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-11-16 10:51:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 10:51:22,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:22,541 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-16 10:51:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:51:22,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 165064281, now seen corresponding path program 1 times [2024-11-16 10:51:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631589786] [2024-11-16 10:51:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,238 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-16 10:51:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631589786] [2024-11-16 10:51:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631589786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800721867] [2024-11-16 10:51:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:23,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:23,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:23,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:23,246 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:23,425 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2024-11-16 10:51:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-16 10:51:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:23,428 INFO L225 Difference]: With dead ends: 395 [2024-11-16 10:51:23,428 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:51:23,429 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-16 10:51:23,431 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:23,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1444 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:51:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:51:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.483204134366925) internal successors, (574), 387 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-16 10:51:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 580 transitions. [2024-11-16 10:51:23,454 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 580 transitions. Word has length 118 [2024-11-16 10:51:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:23,455 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 580 transitions. [2024-11-16 10:51:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 580 transitions. [2024-11-16 10:51:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 10:51:23,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:23,463 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-16 10:51:23,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:51:23,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:23,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 967079114, now seen corresponding path program 1 times [2024-11-16 10:51:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014149185] [2024-11-16 10:51:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:23,867 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-16 10:51:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014149185] [2024-11-16 10:51:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014149185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397239994] [2024-11-16 10:51:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:23,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:23,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:23,871 INFO L87 Difference]: Start difference. First operand 392 states and 580 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-16 10:51:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:24,360 INFO L93 Difference]: Finished difference Result 973 states and 1443 transitions. [2024-11-16 10:51:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:24,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-16 10:51:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:24,367 INFO L225 Difference]: With dead ends: 973 [2024-11-16 10:51:24,367 INFO L226 Difference]: Without dead ends: 392 [2024-11-16 10:51:24,369 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-16 10:51:24,374 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 1091 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:24,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1419 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:51:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-16 10:51:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-16 10:51:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 10:51:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-11-16 10:51:24,392 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 119 [2024-11-16 10:51:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:24,396 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-11-16 10:51:24,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 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-16 10:51:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-11-16 10:51:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 10:51:24,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:24,398 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-16 10:51:24,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:51:24,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 806869547, now seen corresponding path program 1 times [2024-11-16 10:51:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834198400] [2024-11-16 10:51:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:24,952 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-16 10:51:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834198400] [2024-11-16 10:51:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834198400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423547480] [2024-11-16 10:51:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:24,957 INFO L87 Difference]: Start difference. First operand 392 states and 579 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-16 10:51:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:25,253 INFO L93 Difference]: Finished difference Result 716 states and 1057 transitions. [2024-11-16 10:51:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:25,255 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-16 10:51:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:25,256 INFO L225 Difference]: With dead ends: 716 [2024-11-16 10:51:25,257 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:25,257 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-16 10:51:25,258 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:25,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4781491002570695) internal successors, (575), 389 states have internal predecessors, (575), 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-16 10:51:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 581 transitions. [2024-11-16 10:51:25,267 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 581 transitions. Word has length 120 [2024-11-16 10:51:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:25,268 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 581 transitions. [2024-11-16 10:51:25,268 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-16 10:51:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 581 transitions. [2024-11-16 10:51:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 10:51:25,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:25,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:25,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:51:25,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1009603939, now seen corresponding path program 1 times [2024-11-16 10:51:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320876777] [2024-11-16 10:51:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:25,687 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-16 10:51:25,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320876777] [2024-11-16 10:51:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320876777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:25,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:25,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300292747] [2024-11-16 10:51:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:25,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:25,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:25,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:25,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:25,691 INFO L87 Difference]: Start difference. First operand 394 states and 581 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:25,929 INFO L93 Difference]: Finished difference Result 718 states and 1058 transitions. [2024-11-16 10:51:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:25,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-11-16 10:51:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:25,931 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:25,931 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:25,932 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-16 10:51:25,933 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 481 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:25,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 902 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4755784061696657) internal successors, (574), 389 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-16 10:51:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-16 10:51:25,944 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 121 [2024-11-16 10:51:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:25,945 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-16 10:51:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-16 10:51:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 10:51:25,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:25,947 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-16 10:51:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:51:25,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:25,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash 531562967, now seen corresponding path program 1 times [2024-11-16 10:51:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542831852] [2024-11-16 10:51:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,219 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-16 10:51:26,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:26,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542831852] [2024-11-16 10:51:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542831852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:26,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437400122] [2024-11-16 10:51:26,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:26,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:26,221 INFO L87 Difference]: Start difference. First operand 394 states and 580 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-16 10:51:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:26,545 INFO L93 Difference]: Finished difference Result 722 states and 1061 transitions. [2024-11-16 10:51:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:26,546 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-16 10:51:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:26,547 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:51:26,547 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:26,548 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-16 10:51:26,549 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 488 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:26,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1406 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4730077120822622) internal successors, (573), 389 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-16 10:51:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 579 transitions. [2024-11-16 10:51:26,564 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 579 transitions. Word has length 122 [2024-11-16 10:51:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:26,564 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 579 transitions. [2024-11-16 10:51:26,564 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-16 10:51:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 579 transitions. [2024-11-16 10:51:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 10:51:26,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:26,565 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-16 10:51:26,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:51:26,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:26,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -72278937, now seen corresponding path program 1 times [2024-11-16 10:51:26,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:26,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146092232] [2024-11-16 10:51:26,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:26,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:26,814 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-16 10:51:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146092232] [2024-11-16 10:51:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146092232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620462907] [2024-11-16 10:51:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:26,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:26,816 INFO L87 Difference]: Start difference. First operand 394 states and 579 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-16 10:51:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:27,002 INFO L93 Difference]: Finished difference Result 718 states and 1054 transitions. [2024-11-16 10:51:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-16 10:51:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:27,003 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:27,003 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:27,004 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-16 10:51:27,005 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1041 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:27,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 902 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4704370179948587) internal successors, (572), 389 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-16 10:51:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2024-11-16 10:51:27,015 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 123 [2024-11-16 10:51:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:27,016 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2024-11-16 10:51:27,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 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-16 10:51:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2024-11-16 10:51:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 10:51:27,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:27,017 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-16 10:51:27,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 10:51:27,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -84426446, now seen corresponding path program 1 times [2024-11-16 10:51:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:27,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384321547] [2024-11-16 10:51:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,216 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-16 10:51:27,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:27,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384321547] [2024-11-16 10:51:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384321547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275388532] [2024-11-16 10:51:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:27,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:27,218 INFO L87 Difference]: Start difference. First operand 394 states and 578 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-16 10:51:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:27,411 INFO L93 Difference]: Finished difference Result 718 states and 1052 transitions. [2024-11-16 10:51:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:27,412 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-16 10:51:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:27,413 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:27,413 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:27,414 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-16 10:51:27,414 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1027 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:27,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 902 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:27,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.467866323907455) internal successors, (571), 389 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-16 10:51:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 577 transitions. [2024-11-16 10:51:27,421 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 577 transitions. Word has length 124 [2024-11-16 10:51:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:27,421 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 577 transitions. [2024-11-16 10:51:27,421 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-16 10:51:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 577 transitions. [2024-11-16 10:51:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-16 10:51:27,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:27,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:27,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 10:51:27,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash -850844761, now seen corresponding path program 1 times [2024-11-16 10:51:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190009028] [2024-11-16 10:51:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:27,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:27,731 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-16 10:51:27,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:27,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190009028] [2024-11-16 10:51:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190009028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058805632] [2024-11-16 10:51:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:27,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:27,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:27,733 INFO L87 Difference]: Start difference. First operand 394 states and 577 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 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-16 10:51:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:28,038 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-16 10:51:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:28,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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-16 10:51:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:28,041 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:28,041 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:28,042 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-16 10:51:28,043 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 484 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:28,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 926 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4627249357326477) internal successors, (569), 389 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-16 10:51:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 575 transitions. [2024-11-16 10:51:28,051 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 575 transitions. Word has length 125 [2024-11-16 10:51:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:28,051 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 575 transitions. [2024-11-16 10:51:28,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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-16 10:51:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 575 transitions. [2024-11-16 10:51:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 10:51:28,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:28,052 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-16 10:51:28,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 10:51:28,053 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:28,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1240331494, now seen corresponding path program 1 times [2024-11-16 10:51:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321446568] [2024-11-16 10:51:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:28,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,346 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-16 10:51:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321446568] [2024-11-16 10:51:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321446568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:28,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719449175] [2024-11-16 10:51:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:28,349 INFO L87 Difference]: Start difference. First operand 394 states and 575 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:28,523 INFO L93 Difference]: Finished difference Result 718 states and 1046 transitions. [2024-11-16 10:51:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:28,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2024-11-16 10:51:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:28,525 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:28,525 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:28,526 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-16 10:51:28,526 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 558 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:28,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 933 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4601542416452442) internal successors, (568), 389 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-16 10:51:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2024-11-16 10:51:28,536 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 127 [2024-11-16 10:51:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:28,537 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2024-11-16 10:51:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2024-11-16 10:51:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 10:51:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:28,538 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-16 10:51:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 10:51:28,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:28,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 577757747, now seen corresponding path program 1 times [2024-11-16 10:51:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067765163] [2024-11-16 10:51:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 10:51:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 10:51:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:28,879 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-16 10:51:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067765163] [2024-11-16 10:51:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067765163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:28,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286451630] [2024-11-16 10:51:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:28,881 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-16 10:51:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:29,225 INFO L93 Difference]: Finished difference Result 718 states and 1044 transitions. [2024-11-16 10:51:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:29,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 128 [2024-11-16 10:51:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:29,227 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:29,227 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:29,227 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-16 10:51:29,228 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 519 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:29,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 930 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4575835475578407) internal successors, (567), 389 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-16 10:51:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 573 transitions. [2024-11-16 10:51:29,235 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 573 transitions. Word has length 128 [2024-11-16 10:51:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:29,235 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 573 transitions. [2024-11-16 10:51:29,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-16 10:51:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 573 transitions. [2024-11-16 10:51:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 10:51:29,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:29,236 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-16 10:51:29,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:51:29,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:29,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1439866612, now seen corresponding path program 1 times [2024-11-16 10:51:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512444991] [2024-11-16 10:51:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:29,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:29,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 10:51:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:29,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 10:51:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:29,598 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-16 10:51:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512444991] [2024-11-16 10:51:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512444991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792675603] [2024-11-16 10:51:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:29,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:29,600 INFO L87 Difference]: Start difference. First operand 394 states and 573 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 10:51:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:29,781 INFO L93 Difference]: Finished difference Result 718 states and 1042 transitions. [2024-11-16 10:51:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:29,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 129 [2024-11-16 10:51:29,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:29,783 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:29,783 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:29,783 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-16 10:51:29,784 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 517 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:29,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 930 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.455012853470437) internal successors, (566), 389 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-16 10:51:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 572 transitions. [2024-11-16 10:51:29,791 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 572 transitions. Word has length 129 [2024-11-16 10:51:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:29,792 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 572 transitions. [2024-11-16 10:51:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 10:51:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 572 transitions. [2024-11-16 10:51:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 10:51:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:29,793 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-16 10:51:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 10:51:29,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1246117868, now seen corresponding path program 1 times [2024-11-16 10:51:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390059966] [2024-11-16 10:51:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:30,179 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-16 10:51:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:30,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390059966] [2024-11-16 10:51:30,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390059966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416711906] [2024-11-16 10:51:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:30,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:30,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:30,181 INFO L87 Difference]: Start difference. First operand 394 states and 572 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-16 10:51:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:30,414 INFO L93 Difference]: Finished difference Result 718 states and 1040 transitions. [2024-11-16 10:51:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:30,415 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-16 10:51:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:30,417 INFO L225 Difference]: With dead ends: 718 [2024-11-16 10:51:30,417 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 10:51:30,418 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-16 10:51:30,419 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 472 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:30,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 892 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 10:51:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 10:51:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4524421593830334) internal successors, (565), 389 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-16 10:51:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 571 transitions. [2024-11-16 10:51:30,429 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 571 transitions. Word has length 130 [2024-11-16 10:51:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 571 transitions. [2024-11-16 10:51:30,430 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-16 10:51:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 571 transitions. [2024-11-16 10:51:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 10:51:30,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:30,431 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-16 10:51:30,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 10:51:30,431 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash -711738532, now seen corresponding path program 1 times [2024-11-16 10:51:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:30,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223654625] [2024-11-16 10:51:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,008 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-16 10:51:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:31,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223654625] [2024-11-16 10:51:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223654625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:31,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:31,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720267408] [2024-11-16 10:51:31,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:31,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:31,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:31,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:31,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:31,010 INFO L87 Difference]: Start difference. First operand 394 states and 571 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-16 10:51:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:31,347 INFO L93 Difference]: Finished difference Result 724 states and 1046 transitions. [2024-11-16 10:51:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:31,348 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-16 10:51:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:31,350 INFO L225 Difference]: With dead ends: 724 [2024-11-16 10:51:31,350 INFO L226 Difference]: Without dead ends: 398 [2024-11-16 10:51:31,351 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-16 10:51:31,351 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:31,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-16 10:51:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-11-16 10:51:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4501278772378516) internal successors, (567), 391 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-16 10:51:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 573 transitions. [2024-11-16 10:51:31,361 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 573 transitions. Word has length 131 [2024-11-16 10:51:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:31,362 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 573 transitions. [2024-11-16 10:51:31,362 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-16 10:51:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 573 transitions. [2024-11-16 10:51:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 10:51:31,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:31,363 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-16 10:51:31,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 10:51:31,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1629532284, now seen corresponding path program 1 times [2024-11-16 10:51:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501235186] [2024-11-16 10:51:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:31,755 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-16 10:51:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501235186] [2024-11-16 10:51:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501235186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:31,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:31,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726629585] [2024-11-16 10:51:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:31,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:31,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:31,757 INFO L87 Difference]: Start difference. First operand 396 states and 573 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:31,994 INFO L93 Difference]: Finished difference Result 722 states and 1042 transitions. [2024-11-16 10:51:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-11-16 10:51:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:31,996 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:51:31,996 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 10:51:31,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-16 10:51:31,999 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 467 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:31,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 899 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 10:51:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 10:51:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4475703324808185) internal successors, (566), 391 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-16 10:51:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 572 transitions. [2024-11-16 10:51:32,006 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 572 transitions. Word has length 132 [2024-11-16 10:51:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:32,007 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 572 transitions. [2024-11-16 10:51:32,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:51:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 572 transitions. [2024-11-16 10:51:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 10:51:32,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:32,008 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-16 10:51:32,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 10:51:32,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:32,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1114957878, now seen corresponding path program 1 times [2024-11-16 10:51:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299193443] [2024-11-16 10:51:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:32,386 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-16 10:51:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299193443] [2024-11-16 10:51:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299193443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:32,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:32,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508507599] [2024-11-16 10:51:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:32,389 INFO L87 Difference]: Start difference. First operand 396 states and 572 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-16 10:51:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:32,690 INFO L93 Difference]: Finished difference Result 722 states and 1040 transitions. [2024-11-16 10:51:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:32,691 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-16 10:51:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:32,692 INFO L225 Difference]: With dead ends: 722 [2024-11-16 10:51:32,692 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 10:51:32,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-16 10:51:32,693 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 924 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:32,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 892 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 10:51:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 10:51:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.4450127877237853) internal successors, (565), 391 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-16 10:51:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 571 transitions. [2024-11-16 10:51:32,701 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 571 transitions. Word has length 133 [2024-11-16 10:51:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:32,702 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 571 transitions. [2024-11-16 10:51:32,702 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-16 10:51:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 571 transitions. [2024-11-16 10:51:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 10:51:32,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:32,703 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:32,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 10:51:32,703 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:32,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash -241491764, now seen corresponding path program 1 times [2024-11-16 10:51:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248877203] [2024-11-16 10:51:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:33,391 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-16 10:51:33,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:33,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248877203] [2024-11-16 10:51:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248877203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078938310] [2024-11-16 10:51:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:33,393 INFO L87 Difference]: Start difference. First operand 396 states and 571 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-16 10:51:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:33,617 INFO L93 Difference]: Finished difference Result 768 states and 1095 transitions. [2024-11-16 10:51:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-16 10:51:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:33,619 INFO L225 Difference]: With dead ends: 768 [2024-11-16 10:51:33,619 INFO L226 Difference]: Without dead ends: 442 [2024-11-16 10:51:33,619 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-16 10:51:33,620 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 19 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:33,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1860 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-16 10:51:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-16 10:51:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 435 states have (on average 1.4206896551724137) internal successors, (618), 435 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-16 10:51:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 624 transitions. [2024-11-16 10:51:33,631 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 624 transitions. Word has length 134 [2024-11-16 10:51:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:33,631 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 624 transitions. [2024-11-16 10:51:33,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 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-16 10:51:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 624 transitions. [2024-11-16 10:51:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 10:51:33,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:33,633 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:33,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 10:51:33,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:33,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash -486614377, now seen corresponding path program 1 times [2024-11-16 10:51:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:33,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352328958] [2024-11-16 10:51:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 10:51:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 10:51:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 10:51:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:34,072 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-16 10:51:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352328958] [2024-11-16 10:51:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352328958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:34,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:51:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468594382] [2024-11-16 10:51:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:34,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:51:34,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:51:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:51:34,074 INFO L87 Difference]: Start difference. First operand 440 states and 624 transitions. Second operand has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-16 10:51:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:34,497 INFO L93 Difference]: Finished difference Result 888 states and 1255 transitions. [2024-11-16 10:51:34,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:51:34,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-16 10:51:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:34,499 INFO L225 Difference]: With dead ends: 888 [2024-11-16 10:51:34,499 INFO L226 Difference]: Without dead ends: 444 [2024-11-16 10:51:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:51:34,500 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 647 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:34,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2141 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:51:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-16 10:51:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-16 10:51:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 437 states have (on average 1.4164759725400458) internal successors, (619), 437 states have internal predecessors, (619), 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-16 10:51:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 625 transitions. [2024-11-16 10:51:34,509 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 625 transitions. Word has length 135 [2024-11-16 10:51:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:34,509 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 625 transitions. [2024-11-16 10:51:34,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 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-16 10:51:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 625 transitions. [2024-11-16 10:51:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 10:51:34,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:34,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:34,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 10:51:34,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:34,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1753918395, now seen corresponding path program 1 times [2024-11-16 10:51:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:34,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689683981] [2024-11-16 10:51:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:34,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 10:51:35,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689683981] [2024-11-16 10:51:35,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689683981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:35,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:35,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65613092] [2024-11-16 10:51:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:35,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:35,064 INFO L87 Difference]: Start difference. First operand 442 states and 625 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 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-16 10:51:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:35,391 INFO L93 Difference]: Finished difference Result 982 states and 1369 transitions. [2024-11-16 10:51:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 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 136 [2024-11-16 10:51:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:35,393 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:35,393 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:35,394 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-16 10:51:35,394 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 858 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:35,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1831 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3870431893687707) internal successors, (835), 602 states have internal predecessors, (835), 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-16 10:51:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 847 transitions. [2024-11-16 10:51:35,409 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 847 transitions. Word has length 136 [2024-11-16 10:51:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:35,409 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 847 transitions. [2024-11-16 10:51:35,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 1 states have call successors, (3), 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-16 10:51:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 847 transitions. [2024-11-16 10:51:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-16 10:51:35,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:35,412 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-16 10:51:35,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 10:51:35,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:35,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash -803383157, now seen corresponding path program 1 times [2024-11-16 10:51:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43621889] [2024-11-16 10:51:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 10:51:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-16 10:51:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:51:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:35,989 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-16 10:51:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43621889] [2024-11-16 10:51:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43621889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848773880] [2024-11-16 10:51:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:35,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:35,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:35,991 INFO L87 Difference]: Start difference. First operand 610 states and 847 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-16 10:51:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:36,171 INFO L93 Difference]: Finished difference Result 982 states and 1368 transitions. [2024-11-16 10:51:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:36,171 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-16 10:51:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:36,173 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:36,173 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:36,174 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-16 10:51:36,174 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 938 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:36,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 890 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3853820598006645) internal successors, (834), 602 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-16 10:51:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 846 transitions. [2024-11-16 10:51:36,187 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 846 transitions. Word has length 325 [2024-11-16 10:51:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:36,187 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 846 transitions. [2024-11-16 10:51:36,188 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-16 10:51:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 846 transitions. [2024-11-16 10:51:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-16 10:51:36,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:36,191 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-16 10:51:36,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 10:51:36,191 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:36,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1143574853, now seen corresponding path program 1 times [2024-11-16 10:51:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:36,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749288696] [2024-11-16 10:51:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-16 10:51:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:51:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-16 10:51:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:36,725 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-16 10:51:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749288696] [2024-11-16 10:51:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749288696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429563203] [2024-11-16 10:51:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:36,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:36,728 INFO L87 Difference]: Start difference. First operand 610 states and 846 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-16 10:51:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:36,909 INFO L93 Difference]: Finished difference Result 982 states and 1366 transitions. [2024-11-16 10:51:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:36,910 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-16 10:51:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:36,912 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:36,913 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:36,913 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-16 10:51:36,914 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 922 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:36,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 890 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3837209302325582) internal successors, (833), 602 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-16 10:51:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 845 transitions. [2024-11-16 10:51:36,927 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 845 transitions. Word has length 326 [2024-11-16 10:51:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:36,927 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 845 transitions. [2024-11-16 10:51:36,928 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-16 10:51:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 845 transitions. [2024-11-16 10:51:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-16 10:51:36,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:36,930 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 10:51:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 10:51:36,931 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash -315722596, now seen corresponding path program 1 times [2024-11-16 10:51:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102658048] [2024-11-16 10:51:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-16 10:51:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-16 10:51:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:51:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:37,591 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-16 10:51:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:37,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102658048] [2024-11-16 10:51:37,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102658048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:37,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:37,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389738820] [2024-11-16 10:51:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:37,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:37,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:37,594 INFO L87 Difference]: Start difference. First operand 610 states and 845 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-16 10:51:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:37,777 INFO L93 Difference]: Finished difference Result 982 states and 1364 transitions. [2024-11-16 10:51:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:37,779 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-16 10:51:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:37,781 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:37,781 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:37,782 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-16 10:51:37,782 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 906 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:37,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 890 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3820598006644518) internal successors, (832), 602 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-16 10:51:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 844 transitions. [2024-11-16 10:51:37,794 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 844 transitions. Word has length 327 [2024-11-16 10:51:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:37,795 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 844 transitions. [2024-11-16 10:51:37,795 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-16 10:51:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 844 transitions. [2024-11-16 10:51:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-16 10:51:37,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:37,797 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-16 10:51:37,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 10:51:37,798 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:37,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1579430326, now seen corresponding path program 1 times [2024-11-16 10:51:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654530438] [2024-11-16 10:51:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-16 10:51:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-16 10:51:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-16 10:51:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:38,303 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-16 10:51:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654530438] [2024-11-16 10:51:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654530438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669887637] [2024-11-16 10:51:38,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:38,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:38,307 INFO L87 Difference]: Start difference. First operand 610 states and 844 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-16 10:51:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:38,483 INFO L93 Difference]: Finished difference Result 982 states and 1362 transitions. [2024-11-16 10:51:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:38,483 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-16 10:51:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:38,485 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:38,485 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:38,486 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-16 10:51:38,486 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 491 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:38,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 897 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3803986710963456) internal successors, (831), 602 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-16 10:51:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 843 transitions. [2024-11-16 10:51:38,497 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 843 transitions. Word has length 328 [2024-11-16 10:51:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:38,498 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 843 transitions. [2024-11-16 10:51:38,498 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-16 10:51:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 843 transitions. [2024-11-16 10:51:38,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-16 10:51:38,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:38,531 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-16 10:51:38,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 10:51:38,532 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1623454163, now seen corresponding path program 1 times [2024-11-16 10:51:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107665587] [2024-11-16 10:51:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-16 10:51:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:51:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-16 10:51:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,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-16 10:51:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107665587] [2024-11-16 10:51:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107665587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031235799] [2024-11-16 10:51:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:39,097 INFO L87 Difference]: Start difference. First operand 610 states and 843 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-16 10:51:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:39,257 INFO L93 Difference]: Finished difference Result 982 states and 1360 transitions. [2024-11-16 10:51:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:39,257 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-16 10:51:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:39,259 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:39,259 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:39,260 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-16 10:51:39,261 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 476 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:39,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 913 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:51:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3787375415282392) internal successors, (830), 602 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-16 10:51:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 842 transitions. [2024-11-16 10:51:39,277 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 842 transitions. Word has length 329 [2024-11-16 10:51:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 842 transitions. [2024-11-16 10:51:39,277 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-16 10:51:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 842 transitions. [2024-11-16 10:51:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-16 10:51:39,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:39,280 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-16 10:51:39,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 10:51:39,281 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1887242151, now seen corresponding path program 1 times [2024-11-16 10:51:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777082990] [2024-11-16 10:51:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:39,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-16 10:51:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:51:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 10:51:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:39,874 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-16 10:51:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:39,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777082990] [2024-11-16 10:51:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777082990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498727358] [2024-11-16 10:51:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:39,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:39,876 INFO L87 Difference]: Start difference. First operand 610 states and 842 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-16 10:51:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:40,033 INFO L93 Difference]: Finished difference Result 982 states and 1358 transitions. [2024-11-16 10:51:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:40,036 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-16 10:51:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:40,038 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:40,038 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:40,039 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-16 10:51:40,039 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 468 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:40,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 913 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:51:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3770764119601329) internal successors, (829), 602 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-16 10:51:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 841 transitions. [2024-11-16 10:51:40,050 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 841 transitions. Word has length 330 [2024-11-16 10:51:40,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:40,051 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 841 transitions. [2024-11-16 10:51:40,051 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-16 10:51:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 841 transitions. [2024-11-16 10:51:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-16 10:51:40,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:40,054 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-16 10:51:40,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 10:51:40,054 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:40,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:40,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1002136894, now seen corresponding path program 1 times [2024-11-16 10:51:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:40,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000841699] [2024-11-16 10:51:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:40,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-16 10:51:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 10:51:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:51:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:40,642 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-16 10:51:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000841699] [2024-11-16 10:51:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000841699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:40,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860412360] [2024-11-16 10:51:40,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:40,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:40,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:40,645 INFO L87 Difference]: Start difference. First operand 610 states and 841 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-16 10:51:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:40,927 INFO L93 Difference]: Finished difference Result 982 states and 1356 transitions. [2024-11-16 10:51:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-16 10:51:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:40,930 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:40,930 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:40,930 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-16 10:51:40,931 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 791 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:40,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 678 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:51:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3754152823920265) internal successors, (828), 602 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-16 10:51:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 840 transitions. [2024-11-16 10:51:40,945 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 840 transitions. Word has length 331 [2024-11-16 10:51:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:40,946 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 840 transitions. [2024-11-16 10:51:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 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-16 10:51:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 840 transitions. [2024-11-16 10:51:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-16 10:51:40,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:40,948 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-16 10:51:40,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 10:51:40,948 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:40,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 43209496, now seen corresponding path program 1 times [2024-11-16 10:51:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772944059] [2024-11-16 10:51:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-16 10:51:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-16 10:51:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-16 10:51:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:42,895 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-16 10:51:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:42,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772944059] [2024-11-16 10:51:42,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772944059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:42,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779348500] [2024-11-16 10:51:42,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:42,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:42,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:42,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:42,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:42,902 INFO L87 Difference]: Start difference. First operand 610 states and 840 transitions. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 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-16 10:51:43,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:43,100 INFO L93 Difference]: Finished difference Result 982 states and 1354 transitions. [2024-11-16 10:51:43,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:43,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 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-16 10:51:43,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:43,103 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:43,103 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:43,104 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-16 10:51:43,104 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 382 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:43,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 904 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 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-16 10:51:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 839 transitions. [2024-11-16 10:51:43,130 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 839 transitions. Word has length 332 [2024-11-16 10:51:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:43,130 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 839 transitions. [2024-11-16 10:51:43,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 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-16 10:51:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 839 transitions. [2024-11-16 10:51:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-16 10:51:43,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:43,140 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 10:51:43,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 10:51:43,141 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:43,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065900, now seen corresponding path program 1 times [2024-11-16 10:51:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:43,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287196866] [2024-11-16 10:51:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-16 10:51:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-16 10:51:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-16 10:51:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:44,217 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-16 10:51:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287196866] [2024-11-16 10:51:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287196866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12118365] [2024-11-16 10:51:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:44,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:44,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:44,220 INFO L87 Difference]: Start difference. First operand 610 states and 839 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-16 10:51:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:44,484 INFO L93 Difference]: Finished difference Result 982 states and 1352 transitions. [2024-11-16 10:51:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:44,485 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-16 10:51:44,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:44,486 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:44,487 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:44,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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-16 10:51:44,488 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 455 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:44,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 889 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 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-16 10:51:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 838 transitions. [2024-11-16 10:51:44,498 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 838 transitions. Word has length 333 [2024-11-16 10:51:44,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:44,498 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 838 transitions. [2024-11-16 10:51:44,498 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-16 10:51:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 838 transitions. [2024-11-16 10:51:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-16 10:51:44,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:44,501 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-16 10:51:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 10:51:44,501 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1542566097, now seen corresponding path program 1 times [2024-11-16 10:51:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043481963] [2024-11-16 10:51:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-16 10:51:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-16 10:51:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-16 10:51:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:45,320 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-16 10:51:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043481963] [2024-11-16 10:51:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043481963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11510039] [2024-11-16 10:51:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:45,322 INFO L87 Difference]: Start difference. First operand 610 states and 838 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-16 10:51:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:45,518 INFO L93 Difference]: Finished difference Result 982 states and 1350 transitions. [2024-11-16 10:51:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:45,518 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-16 10:51:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:45,520 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:45,520 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:45,521 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-16 10:51:45,521 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 454 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:45,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 889 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3704318936877076) internal successors, (825), 602 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-16 10:51:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 837 transitions. [2024-11-16 10:51:45,531 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 837 transitions. Word has length 334 [2024-11-16 10:51:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:45,532 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 837 transitions. [2024-11-16 10:51:45,532 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-16 10:51:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 837 transitions. [2024-11-16 10:51:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-16 10:51:45,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:45,533 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-16 10:51:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 10:51:45,534 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1125792784, now seen corresponding path program 1 times [2024-11-16 10:51:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139943649] [2024-11-16 10:51:45,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-16 10:51:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-16 10:51:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:51:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:46,291 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-16 10:51:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139943649] [2024-11-16 10:51:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139943649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:51:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860048703] [2024-11-16 10:51:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:51:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:51:46,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:51:46,293 INFO L87 Difference]: Start difference. First operand 610 states and 837 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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-16 10:51:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:46,469 INFO L93 Difference]: Finished difference Result 982 states and 1348 transitions. [2024-11-16 10:51:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:51:46,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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-16 10:51:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:46,472 INFO L225 Difference]: With dead ends: 982 [2024-11-16 10:51:46,472 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 10:51:46,472 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-16 10:51:46,473 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 391 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:46,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 882 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:51:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 10:51:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 10:51:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 602 states have (on average 1.3687707641196014) internal successors, (824), 602 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-16 10:51:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 836 transitions. [2024-11-16 10:51:46,483 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 836 transitions. Word has length 335 [2024-11-16 10:51:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:46,483 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 836 transitions. [2024-11-16 10:51:46,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 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-16 10:51:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 836 transitions. [2024-11-16 10:51:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-16 10:51:46,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:46,485 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-16 10:51:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 10:51:46,485 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1802060084, now seen corresponding path program 1 times [2024-11-16 10:51:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205931568] [2024-11-16 10:51:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 10:51:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-16 10:51:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:51:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:47,376 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-16 10:51:47,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:47,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205931568] [2024-11-16 10:51:47,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205931568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:47,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:47,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153719264] [2024-11-16 10:51:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:47,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:47,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:47,378 INFO L87 Difference]: Start difference. First operand 610 states and 836 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-16 10:51:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:47,966 INFO L93 Difference]: Finished difference Result 1431 states and 1967 transitions. [2024-11-16 10:51:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:47,966 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-16 10:51:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:47,969 INFO L225 Difference]: With dead ends: 1431 [2024-11-16 10:51:47,969 INFO L226 Difference]: Without dead ends: 1059 [2024-11-16 10:51:47,970 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-16 10:51:47,970 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 354 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:47,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1934 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-16 10:51:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 937. [2024-11-16 10:51:47,983 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-16 10:51:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1282 transitions. [2024-11-16 10:51:47,984 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1282 transitions. Word has length 336 [2024-11-16 10:51:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:47,985 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1282 transitions. [2024-11-16 10:51:47,985 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-16 10:51:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1282 transitions. [2024-11-16 10:51:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-16 10:51:47,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:47,987 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-16 10:51:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 10:51:47,987 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1808030278, now seen corresponding path program 1 times [2024-11-16 10:51:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:47,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356795829] [2024-11-16 10:51:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 10:51:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 10:51:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-16 10:51:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 10:51:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-16 10:51:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-16 10:51:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356795829] [2024-11-16 10:51:49,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356795829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:51:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102764621] [2024-11-16 10:51:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:49,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:51:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:51:49,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:51:49,159 INFO L87 Difference]: Start difference. First operand 937 states and 1282 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 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-16 10:51:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:49,699 INFO L93 Difference]: Finished difference Result 1739 states and 2371 transitions. [2024-11-16 10:51:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:49,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 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 337 [2024-11-16 10:51:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:49,702 INFO L225 Difference]: With dead ends: 1739 [2024-11-16 10:51:49,702 INFO L226 Difference]: Without dead ends: 949 [2024-11-16 10:51:49,703 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-16 10:51:49,704 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1039 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:49,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1309 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:51:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-16 10:51:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 943. [2024-11-16 10:51:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 932 states have (on average 1.359442060085837) internal successors, (1267), 932 states have internal predecessors, (1267), 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-16 10:51:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1285 transitions. [2024-11-16 10:51:49,725 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1285 transitions. Word has length 337 [2024-11-16 10:51:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:49,726 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1285 transitions. [2024-11-16 10:51:49,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 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-16 10:51:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1285 transitions. [2024-11-16 10:51:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-16 10:51:49,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:49,729 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-16 10:51:49,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 10:51:49,729 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:49,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 835547180, now seen corresponding path program 1 times [2024-11-16 10:51:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448350276] [2024-11-16 10:51:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:51:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:51:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-16 10:51:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:51:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-16 10:51:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-16 10:51:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448350276] [2024-11-16 10:51:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448350276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:51:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050547357] [2024-11-16 10:51:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:51:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:51:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:51:51,316 INFO L87 Difference]: Start difference. First operand 943 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 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-16 10:51:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:51,986 INFO L93 Difference]: Finished difference Result 1611 states and 2175 transitions. [2024-11-16 10:51:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:51,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 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-16 10:51:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:51,989 INFO L225 Difference]: With dead ends: 1611 [2024-11-16 10:51:51,989 INFO L226 Difference]: Without dead ends: 955 [2024-11-16 10:51:51,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-16 10:51:51,990 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 466 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:51,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1014 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:51:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-16 10:51:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 949. [2024-11-16 10:51:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 938 states have (on average 1.3571428571428572) internal successors, (1273), 938 states have internal predecessors, (1273), 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-16 10:51:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1291 transitions. [2024-11-16 10:51:52,004 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1291 transitions. Word has length 339 [2024-11-16 10:51:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:52,004 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1291 transitions. [2024-11-16 10:51:52,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.8) internal successors, (279), 5 states have internal predecessors, (279), 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-16 10:51:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1291 transitions. [2024-11-16 10:51:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-16 10:51:52,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:52,010 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-16 10:51:52,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 10:51:52,011 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -711608478, now seen corresponding path program 1 times [2024-11-16 10:51:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927426356] [2024-11-16 10:51:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:51:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:51:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-16 10:51:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-16 10:51:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-16 10:51:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-16 10:51:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927426356] [2024-11-16 10:51:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927426356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76581665] [2024-11-16 10:51:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:53,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:53,380 INFO L87 Difference]: Start difference. First operand 949 states and 1291 transitions. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-16 10:51:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:53,814 INFO L93 Difference]: Finished difference Result 1613 states and 2171 transitions. [2024-11-16 10:51:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:51:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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 339 [2024-11-16 10:51:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:53,818 INFO L225 Difference]: With dead ends: 1613 [2024-11-16 10:51:53,819 INFO L226 Difference]: Without dead ends: 955 [2024-11-16 10:51:53,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:51:53,820 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 507 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:53,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 994 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:51:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-16 10:51:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 949. [2024-11-16 10:51:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 938 states have (on average 1.3507462686567164) internal successors, (1267), 938 states have internal predecessors, (1267), 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-16 10:51:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1285 transitions. [2024-11-16 10:51:53,834 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1285 transitions. Word has length 339 [2024-11-16 10:51:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:53,834 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1285 transitions. [2024-11-16 10:51:53,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-16 10:51:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1285 transitions. [2024-11-16 10:51:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-16 10:51:53,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:53,836 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-16 10:51:53,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 10:51:53,837 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:53,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:53,837 INFO L85 PathProgramCache]: Analyzing trace with hash -871550470, now seen corresponding path program 1 times [2024-11-16 10:51:53,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961865186] [2024-11-16 10:51:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:51:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:51:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-16 10:51:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-16 10:51:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-16 10:51:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:51:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961865186] [2024-11-16 10:51:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961865186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435446038] [2024-11-16 10:51:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:54,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:54,915 INFO L87 Difference]: Start difference. First operand 949 states and 1285 transitions. Second operand has 6 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 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-16 10:51:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:55,767 INFO L93 Difference]: Finished difference Result 1348 states and 1830 transitions. [2024-11-16 10:51:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:51:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 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 341 [2024-11-16 10:51:55,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:55,770 INFO L225 Difference]: With dead ends: 1348 [2024-11-16 10:51:55,770 INFO L226 Difference]: Without dead ends: 972 [2024-11-16 10:51:55,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:51:55,771 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 761 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:55,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1313 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 10:51:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-16 10:51:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 950. [2024-11-16 10:51:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 939 states have (on average 1.3503727369542067) internal successors, (1268), 939 states have internal predecessors, (1268), 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-16 10:51:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1286 transitions. [2024-11-16 10:51:55,789 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1286 transitions. Word has length 341 [2024-11-16 10:51:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1286 transitions. [2024-11-16 10:51:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.333333333333336) internal successors, (314), 6 states have internal predecessors, (314), 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-16 10:51:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1286 transitions. [2024-11-16 10:51:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-16 10:51:55,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:55,792 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-16 10:51:55,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 10:51:55,792 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:55,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 800552928, now seen corresponding path program 1 times [2024-11-16 10:51:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624669660] [2024-11-16 10:51:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:51:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 10:51:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 10:51:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-16 10:51:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-16 10:51:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-16 10:51:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-16 10:51:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624669660] [2024-11-16 10:51:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624669660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:51:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7808502] [2024-11-16 10:51:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:51:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:51:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:51:57,305 INFO L87 Difference]: Start difference. First operand 950 states and 1286 transitions. Second operand has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 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-16 10:51:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:51:58,657 INFO L93 Difference]: Finished difference Result 2140 states and 2891 transitions. [2024-11-16 10:51:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:51:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 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 341 [2024-11-16 10:51:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:51:58,662 INFO L225 Difference]: With dead ends: 2140 [2024-11-16 10:51:58,662 INFO L226 Difference]: Without dead ends: 1646 [2024-11-16 10:51:58,663 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-16 10:51:58,663 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 1366 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:51:58,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 3228 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 10:51:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2024-11-16 10:51:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1021. [2024-11-16 10:51:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1007 states have (on average 1.3515392254220457) internal successors, (1361), 1007 states have internal predecessors, (1361), 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-16 10:51:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1385 transitions. [2024-11-16 10:51:58,690 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1385 transitions. Word has length 341 [2024-11-16 10:51:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:51:58,690 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1385 transitions. [2024-11-16 10:51:58,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.875) internal successors, (263), 8 states have internal predecessors, (263), 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-16 10:51:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1385 transitions. [2024-11-16 10:51:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-16 10:51:58,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:51:58,694 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:51:58,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 10:51:58,694 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:51:58,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:51:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2079540459, now seen corresponding path program 1 times [2024-11-16 10:51:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:51:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453590027] [2024-11-16 10:51:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:51:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:51:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 10:51:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 10:51:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 10:51:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-16 10:51:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-16 10:51:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-16 10:51:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:51:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-16 10:51:59,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:51:59,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453590027] [2024-11-16 10:51:59,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453590027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:51:59,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:51:59,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:51:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119299193] [2024-11-16 10:51:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:51:59,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:51:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:51:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:51:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:51:59,891 INFO L87 Difference]: Start difference. First operand 1021 states and 1385 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:52:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:00,366 INFO L93 Difference]: Finished difference Result 1898 states and 2562 transitions. [2024-11-16 10:52:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:52:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 342 [2024-11-16 10:52:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:00,369 INFO L225 Difference]: With dead ends: 1898 [2024-11-16 10:52:00,369 INFO L226 Difference]: Without dead ends: 1029 [2024-11-16 10:52:00,370 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-16 10:52:00,370 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 511 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:00,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1309 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:52:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-16 10:52:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2024-11-16 10:52:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1011 states have (on average 1.3501483679525224) internal successors, (1365), 1011 states have internal predecessors, (1365), 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-16 10:52:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1389 transitions. [2024-11-16 10:52:00,387 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1389 transitions. Word has length 342 [2024-11-16 10:52:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:00,387 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1389 transitions. [2024-11-16 10:52:00,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 10:52:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1389 transitions. [2024-11-16 10:52:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-16 10:52:00,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:00,389 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, 1] [2024-11-16 10:52:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 10:52:00,389 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:00,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1299278563, now seen corresponding path program 1 times [2024-11-16 10:52:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801170027] [2024-11-16 10:52:00,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 10:52:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 10:52:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 10:52:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-16 10:52:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-16 10:52:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801170027] [2024-11-16 10:52:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801170027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600364861] [2024-11-16 10:52:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:01,597 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-16 10:52:01,598 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-16 10:52:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:02,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 2054 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 10:52:02,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-16 10:52:02,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:52:02,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600364861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:02,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:52:02,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-11-16 10:52:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55850298] [2024-11-16 10:52:02,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:02,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:52:02,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:02,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:52:02,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:52:02,766 INFO L87 Difference]: Start difference. First operand 1025 states and 1389 transitions. Second operand has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 10:52:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:03,438 INFO L93 Difference]: Finished difference Result 1859 states and 2513 transitions. [2024-11-16 10:52:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:52:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 344 [2024-11-16 10:52:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:03,441 INFO L225 Difference]: With dead ends: 1859 [2024-11-16 10:52:03,441 INFO L226 Difference]: Without dead ends: 1049 [2024-11-16 10:52:03,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-16 10:52:03,442 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 498 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:03,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 2226 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:52:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2024-11-16 10:52:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1041. [2024-11-16 10:52:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1027 states have (on average 1.340798442064265) internal successors, (1377), 1027 states have internal predecessors, (1377), 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-16 10:52:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1401 transitions. [2024-11-16 10:52:03,458 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1401 transitions. Word has length 344 [2024-11-16 10:52:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:03,458 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1401 transitions. [2024-11-16 10:52:03,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 29.555555555555557) internal successors, (266), 9 states have internal predecessors, (266), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 10:52:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1401 transitions. [2024-11-16 10:52:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-16 10:52:03,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:03,460 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, 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] [2024-11-16 10:52:03,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 10:52:03,664 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,SelfDestructingSolverStorable37 [2024-11-16 10:52:03,665 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1234905925, now seen corresponding path program 1 times [2024-11-16 10:52:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:03,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789132199] [2024-11-16 10:52:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789132199] [2024-11-16 10:52:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789132199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117857188] [2024-11-16 10:52:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:05,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:05,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:05,422 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-16 10:52:05,423 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-16 10:52:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:06,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 10:52:06,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:06,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117857188] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:52:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2024-11-16 10:52:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880283446] [2024-11-16 10:52:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:52:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:52:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:52:07,111 INFO L87 Difference]: Start difference. First operand 1041 states and 1401 transitions. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-16 10:52:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:07,651 INFO L93 Difference]: Finished difference Result 1801 states and 2430 transitions. [2024-11-16 10:52:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:52:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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 350 [2024-11-16 10:52:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:07,655 INFO L225 Difference]: With dead ends: 1801 [2024-11-16 10:52:07,655 INFO L226 Difference]: Without dead ends: 1420 [2024-11-16 10:52:07,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2024-11-16 10:52:07,657 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 355 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:07,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 4467 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:52:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-11-16 10:52:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1216. [2024-11-16 10:52:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1199 states have (on average 1.3302752293577982) internal successors, (1595), 1199 states have internal predecessors, (1595), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 10:52:07,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1625 transitions. [2024-11-16 10:52:07,677 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1625 transitions. Word has length 350 [2024-11-16 10:52:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:07,677 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1625 transitions. [2024-11-16 10:52:07,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 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-16 10:52:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1625 transitions. [2024-11-16 10:52:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-16 10:52:07,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:07,680 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:07,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 10:52:07,884 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,SelfDestructingSolverStorable38 [2024-11-16 10:52:07,885 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:07,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -80631322, now seen corresponding path program 1 times [2024-11-16 10:52:07,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:07,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924876565] [2024-11-16 10:52:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:07,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-16 10:52:08,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:08,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924876565] [2024-11-16 10:52:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924876565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:08,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:08,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:52:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334498666] [2024-11-16 10:52:08,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:08,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:52:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:52:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:52:08,428 INFO L87 Difference]: Start difference. First operand 1216 states and 1625 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 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-16 10:52:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:08,610 INFO L93 Difference]: Finished difference Result 2085 states and 2790 transitions. [2024-11-16 10:52:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:52:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 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 350 [2024-11-16 10:52:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:08,613 INFO L225 Difference]: With dead ends: 2085 [2024-11-16 10:52:08,613 INFO L226 Difference]: Without dead ends: 1288 [2024-11-16 10:52:08,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:52:08,615 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 16 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:08,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1806 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:52:08,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-11-16 10:52:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1288. [2024-11-16 10:52:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1271 states have (on average 1.3367427222659323) internal successors, (1699), 1271 states have internal predecessors, (1699), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 10:52:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1729 transitions. [2024-11-16 10:52:08,634 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1729 transitions. Word has length 350 [2024-11-16 10:52:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1729 transitions. [2024-11-16 10:52:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (3), 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-16 10:52:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1729 transitions. [2024-11-16 10:52:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:52:08,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:08,637 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 10:52:08,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 10:52:08,637 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1543050058, now seen corresponding path program 1 times [2024-11-16 10:52:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855589546] [2024-11-16 10:52:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:52:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:52:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:52:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855589546] [2024-11-16 10:52:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855589546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:10,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:52:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297352374] [2024-11-16 10:52:10,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:10,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:52:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:10,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:52:10,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:52:10,738 INFO L87 Difference]: Start difference. First operand 1288 states and 1729 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 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-16 10:52:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:11,444 INFO L93 Difference]: Finished difference Result 3431 states and 4610 transitions. [2024-11-16 10:52:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:52:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 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 351 [2024-11-16 10:52:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:11,453 INFO L225 Difference]: With dead ends: 3431 [2024-11-16 10:52:11,453 INFO L226 Difference]: Without dead ends: 2839 [2024-11-16 10:52:11,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:52:11,459 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 1568 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 3791 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:11,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 3791 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:52:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2024-11-16 10:52:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2075. [2024-11-16 10:52:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2049 states have (on average 1.3382137628111275) internal successors, (2742), 2049 states have internal predecessors, (2742), 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-16 10:52:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2790 transitions. [2024-11-16 10:52:11,501 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2790 transitions. Word has length 351 [2024-11-16 10:52:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 2790 transitions. [2024-11-16 10:52:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 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-16 10:52:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2790 transitions. [2024-11-16 10:52:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:52:11,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:11,505 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:11,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 10:52:11,506 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2075948431, now seen corresponding path program 1 times [2024-11-16 10:52:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030062571] [2024-11-16 10:52:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-16 10:52:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:12,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030062571] [2024-11-16 10:52:12,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030062571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:12,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:52:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676465830] [2024-11-16 10:52:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:12,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:52:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:52:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:52:12,172 INFO L87 Difference]: Start difference. First operand 2075 states and 2790 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 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-16 10:52:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:12,334 INFO L93 Difference]: Finished difference Result 3601 states and 4823 transitions. [2024-11-16 10:52:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:52:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 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 351 [2024-11-16 10:52:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:12,342 INFO L225 Difference]: With dead ends: 3601 [2024-11-16 10:52:12,345 INFO L226 Difference]: Without dead ends: 2087 [2024-11-16 10:52:12,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-16 10:52:12,348 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 0 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:12,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1357 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:52:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2024-11-16 10:52:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2087. [2024-11-16 10:52:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2087 states, 2061 states have (on average 1.3362445414847162) internal successors, (2754), 2061 states have internal predecessors, (2754), 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-16 10:52:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2802 transitions. [2024-11-16 10:52:12,395 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2802 transitions. Word has length 351 [2024-11-16 10:52:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:12,395 INFO L471 AbstractCegarLoop]: Abstraction has 2087 states and 2802 transitions. [2024-11-16 10:52:12,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 1 states have call successors, (3), 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-16 10:52:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2802 transitions. [2024-11-16 10:52:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:52:12,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:12,400 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, 1, 1, 1, 1] [2024-11-16 10:52:12,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-16 10:52:12,400 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:12,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1999178972, now seen corresponding path program 1 times [2024-11-16 10:52:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:12,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000860797] [2024-11-16 10:52:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-16 10:52:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000860797] [2024-11-16 10:52:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000860797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 10:52:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439120886] [2024-11-16 10:52:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:14,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 10:52:14,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:14,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 10:52:14,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:52:14,804 INFO L87 Difference]: Start difference. First operand 2087 states and 2802 transitions. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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-16 10:52:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:15,662 INFO L93 Difference]: Finished difference Result 3968 states and 5327 transitions. [2024-11-16 10:52:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 10:52:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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 351 [2024-11-16 10:52:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:15,666 INFO L225 Difference]: With dead ends: 3968 [2024-11-16 10:52:15,666 INFO L226 Difference]: Without dead ends: 2805 [2024-11-16 10:52:15,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:52:15,668 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 1714 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:15,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 4794 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 10:52:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2024-11-16 10:52:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2179. [2024-11-16 10:52:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 2149 states have (on average 1.3345742205677058) internal successors, (2868), 2149 states have internal predecessors, (2868), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 10:52:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2924 transitions. [2024-11-16 10:52:15,699 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2924 transitions. Word has length 351 [2024-11-16 10:52:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:15,699 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 2924 transitions. [2024-11-16 10:52:15,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 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-16 10:52:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2924 transitions. [2024-11-16 10:52:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:52:15,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:15,703 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-16 10:52:15,703 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:15,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1821441639, now seen corresponding path program 1 times [2024-11-16 10:52:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:15,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108911256] [2024-11-16 10:52:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-16 10:52:17,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108911256] [2024-11-16 10:52:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108911256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:52:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404763529] [2024-11-16 10:52:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:17,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:52:17,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:52:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:52:17,764 INFO L87 Difference]: Start difference. First operand 2179 states and 2924 transitions. Second operand has 9 states, 9 states have (on average 31.333333333333332) internal successors, (282), 9 states have internal predecessors, (282), 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-16 10:52:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:18,779 INFO L93 Difference]: Finished difference Result 5307 states and 7068 transitions. [2024-11-16 10:52:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 10:52:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.333333333333332) internal successors, (282), 9 states have internal predecessors, (282), 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 351 [2024-11-16 10:52:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:18,784 INFO L225 Difference]: With dead ends: 5307 [2024-11-16 10:52:18,785 INFO L226 Difference]: Without dead ends: 3821 [2024-11-16 10:52:18,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:52:18,787 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 856 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:18,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 2819 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 10:52:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2024-11-16 10:52:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2541. [2024-11-16 10:52:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2501 states have (on average 1.33546581367453) internal successors, (3340), 2501 states have internal predecessors, (3340), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 10:52:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 3416 transitions. [2024-11-16 10:52:18,873 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 3416 transitions. Word has length 351 [2024-11-16 10:52:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:18,873 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 3416 transitions. [2024-11-16 10:52:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.333333333333332) internal successors, (282), 9 states have internal predecessors, (282), 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-16 10:52:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3416 transitions. [2024-11-16 10:52:18,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-16 10:52:18,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:18,887 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:18,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-16 10:52:18,888 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:18,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1374873341, now seen corresponding path program 1 times [2024-11-16 10:52:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:18,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991671272] [2024-11-16 10:52:18,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-16 10:52:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-16 10:52:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-16 10:52:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991671272] [2024-11-16 10:52:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991671272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768480933] [2024-11-16 10:52:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:23,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:23,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:23,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:52:23,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 10:52:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:25,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 2065 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 10:52:25,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-16 10:52:25,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:52:25,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768480933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:25,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:52:25,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-16 10:52:25,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197375778] [2024-11-16 10:52:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:25,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:52:25,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:25,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:52:25,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:52:25,308 INFO L87 Difference]: Start difference. First operand 2541 states and 3416 transitions. Second operand has 6 states, 5 states have (on average 60.4) internal successors, (302), 6 states have internal predecessors, (302), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 10:52:25,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:25,560 INFO L93 Difference]: Finished difference Result 4477 states and 6015 transitions. [2024-11-16 10:52:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:52:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 60.4) internal successors, (302), 6 states have internal predecessors, (302), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 351 [2024-11-16 10:52:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:25,565 INFO L225 Difference]: With dead ends: 4477 [2024-11-16 10:52:25,565 INFO L226 Difference]: Without dead ends: 2541 [2024-11-16 10:52:25,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:52:25,567 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:25,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:52:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-11-16 10:52:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2541. [2024-11-16 10:52:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2541 states, 2501 states have (on average 1.327469012395042) internal successors, (3320), 2501 states have internal predecessors, (3320), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 10:52:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 3396 transitions. [2024-11-16 10:52:25,603 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 3396 transitions. Word has length 351 [2024-11-16 10:52:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:25,603 INFO L471 AbstractCegarLoop]: Abstraction has 2541 states and 3396 transitions. [2024-11-16 10:52:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 60.4) internal successors, (302), 6 states have internal predecessors, (302), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 10:52:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3396 transitions. [2024-11-16 10:52:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-16 10:52:25,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:25,607 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:25,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 10:52:25,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:25,808 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:25,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -185811323, now seen corresponding path program 1 times [2024-11-16 10:52:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:25,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997315233] [2024-11-16 10:52:25,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:25,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 10:52:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:52:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:52:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:52:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 10:52:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997315233] [2024-11-16 10:52:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997315233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:52:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532604111] [2024-11-16 10:52:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:52:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:52:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:52:27,684 INFO L87 Difference]: Start difference. First operand 2541 states and 3396 transitions. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 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-16 10:52:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:28,744 INFO L93 Difference]: Finished difference Result 4869 states and 6490 transitions. [2024-11-16 10:52:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:52:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 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 353 [2024-11-16 10:52:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:28,750 INFO L225 Difference]: With dead ends: 4869 [2024-11-16 10:52:28,750 INFO L226 Difference]: Without dead ends: 3821 [2024-11-16 10:52:28,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:52:28,752 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 798 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2838 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:28,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2838 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 10:52:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2024-11-16 10:52:28,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3334. [2024-11-16 10:52:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3294 states have (on average 1.3111718275652702) internal successors, (4319), 3294 states have internal predecessors, (4319), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 10:52:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4395 transitions. [2024-11-16 10:52:28,797 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4395 transitions. Word has length 353 [2024-11-16 10:52:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:28,797 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4395 transitions. [2024-11-16 10:52:28,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 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-16 10:52:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4395 transitions. [2024-11-16 10:52:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-16 10:52:28,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:28,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 10:52:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-16 10:52:28,803 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 649006255, now seen corresponding path program 1 times [2024-11-16 10:52:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723007915] [2024-11-16 10:52:28,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 10:52:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 10:52:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 10:52:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-16 10:52:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 10:52:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-11-16 10:52:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 50 proven. 35 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 10:52:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723007915] [2024-11-16 10:52:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723007915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936976648] [2024-11-16 10:52:33,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:33,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:33,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:52:33,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 10:52:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:34,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 2071 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 10:52:34,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 10:52:35,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:52:35,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936976648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:35,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:52:35,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-11-16 10:52:35,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005846423] [2024-11-16 10:52:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:35,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:52:35,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:52:35,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-16 10:52:35,010 INFO L87 Difference]: Start difference. First operand 3334 states and 4395 transitions. Second operand has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 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-16 10:52:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:35,721 INFO L93 Difference]: Finished difference Result 6118 states and 8106 transitions. [2024-11-16 10:52:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:52:35,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 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 353 [2024-11-16 10:52:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:35,731 INFO L225 Difference]: With dead ends: 6118 [2024-11-16 10:52:35,731 INFO L226 Difference]: Without dead ends: 4613 [2024-11-16 10:52:35,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-11-16 10:52:35,732 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1349 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:35,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 1987 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 10:52:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states.