/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem16_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:21:38,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:21:38,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:21:38,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:21:38,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:21:38,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:21:38,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:21:38,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:21:38,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:21:38,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:21:38,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:21:38,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:21:38,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:21:38,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:21:38,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:21:38,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:21:38,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:21:38,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:21:38,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:21:38,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:21:38,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:21:38,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:21:38,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:21:38,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:21:38,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:21:38,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:21:38,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:21:38,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:21:38,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:21:38,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:21:38,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:21:38,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:21:38,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:21:38,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:21:38,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:21:38,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:21:38,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:21:38,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:21:38,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:21:38,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:21:38,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:21:38,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:21:38,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:21:38,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:21:38,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:21:38,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:21:38,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:21:38,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:21:38,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:21:38,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:21:38,316 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:21:38,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:21:38,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:21:38,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:21:38,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:21:38,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:21:38,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:21:38,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:21:38,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:21:38,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:21:38,543 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:21:38,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label38.c [2022-01-10 00:21:38,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18668893/37c1c88843d04b9f9124a9e0dd10fd6f/FLAGa9719d0f1 [2022-01-10 00:21:39,060 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:21:39,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label38.c [2022-01-10 00:21:39,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18668893/37c1c88843d04b9f9124a9e0dd10fd6f/FLAGa9719d0f1 [2022-01-10 00:21:39,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18668893/37c1c88843d04b9f9124a9e0dd10fd6f [2022-01-10 00:21:39,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:21:39,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:21:39,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:21:39,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:21:39,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:21:39,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120cbe80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39, skipping insertion in model container [2022-01-10 00:21:39,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:21:39,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:21:39,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label38.c[1461,1474] [2022-01-10 00:21:39,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:21:39,669 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:21:39,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label38.c[1461,1474] [2022-01-10 00:21:39,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:21:39,819 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:21:39,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39 WrapperNode [2022-01-10 00:21:39,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:21:39,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:21:39,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:21:39,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:21:39,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,946 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1768 [2022-01-10 00:21:39,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:21:39,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:21:39,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:21:39,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:21:39,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:39,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:40,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:40,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:40,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:21:40,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:21:40,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:21:40,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:21:40,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (1/1) ... [2022-01-10 00:21:40,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:21:40,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:21:40,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:21:40,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:21:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:21:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:21:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:21:40,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:21:40,128 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:21:40,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:21:41,520 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:21:41,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:21:41,531 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:21:41,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:21:41 BoogieIcfgContainer [2022-01-10 00:21:41,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:21:41,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:21:41,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:21:41,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:21:41,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:21:39" (1/3) ... [2022-01-10 00:21:41,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a72cada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:21:41, skipping insertion in model container [2022-01-10 00:21:41,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:21:39" (2/3) ... [2022-01-10 00:21:41,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a72cada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:21:41, skipping insertion in model container [2022-01-10 00:21:41,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:21:41" (3/3) ... [2022-01-10 00:21:41,541 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem16_label38.c [2022-01-10 00:21:41,545 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:21:41,545 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:21:41,588 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:21:41,594 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:21:41,594 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:21:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 00:21:41,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:41,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:21:41,623 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:41,627 INFO L85 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2022-01-10 00:21:41,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:41,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458817543] [2022-01-10 00:21:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:41,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:41,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:41,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458817543] [2022-01-10 00:21:41,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458817543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:41,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:41,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:21:41,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557418340] [2022-01-10 00:21:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:41,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:41,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:41,799 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:43,052 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2022-01-10 00:21:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 00:21:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:43,068 INFO L225 Difference]: With dead ends: 1122 [2022-01-10 00:21:43,068 INFO L226 Difference]: Without dead ends: 662 [2022-01-10 00:21:43,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:43,074 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 376 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:43,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 00:21:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-01-10 00:21:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2022-01-10 00:21:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2022-01-10 00:21:43,123 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 11 [2022-01-10 00:21:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:43,123 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2022-01-10 00:21:43,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2022-01-10 00:21:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 00:21:43,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:43,125 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 00:21:43,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:21:43,126 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 854673318, now seen corresponding path program 1 times [2022-01-10 00:21:43,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:43,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586365256] [2022-01-10 00:21:43,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:43,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:43,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:43,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586365256] [2022-01-10 00:21:43,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586365256] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:43,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:43,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:21:43,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922121767] [2022-01-10 00:21:43,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:43,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:43,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:43,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:43,230 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:44,639 INFO L93 Difference]: Finished difference Result 1980 states and 3007 transitions. [2022-01-10 00:21:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-01-10 00:21:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:44,643 INFO L225 Difference]: With dead ends: 1980 [2022-01-10 00:21:44,643 INFO L226 Difference]: Without dead ends: 1320 [2022-01-10 00:21:44,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:44,646 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:44,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 217 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 00:21:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-01-10 00:21:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2022-01-10 00:21:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2022-01-10 00:21:44,680 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 79 [2022-01-10 00:21:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:44,681 INFO L470 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2022-01-10 00:21:44,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2022-01-10 00:21:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-10 00:21:44,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:44,683 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 00:21:44,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:21:44,684 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:44,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1612261121, now seen corresponding path program 1 times [2022-01-10 00:21:44,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:44,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192764851] [2022-01-10 00:21:44,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:44,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:44,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:44,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192764851] [2022-01-10 00:21:44,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192764851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:44,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:44,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:21:44,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901425904] [2022-01-10 00:21:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:44,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:44,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:44,785 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:45,822 INFO L93 Difference]: Finished difference Result 3954 states and 5755 transitions. [2022-01-10 00:21:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-01-10 00:21:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:45,831 INFO L225 Difference]: With dead ends: 3954 [2022-01-10 00:21:45,831 INFO L226 Difference]: Without dead ends: 2636 [2022-01-10 00:21:45,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:45,838 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:45,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 00:21:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-01-10 00:21:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2022-01-10 00:21:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions. [2022-01-10 00:21:45,880 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 90 [2022-01-10 00:21:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:45,882 INFO L470 AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions. [2022-01-10 00:21:45,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions. [2022-01-10 00:21:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-10 00:21:45,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:45,888 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:45,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:21:45,888 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash -150834047, now seen corresponding path program 1 times [2022-01-10 00:21:45,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:45,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303429493] [2022-01-10 00:21:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:45,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 00:21:45,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303429493] [2022-01-10 00:21:45,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303429493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:45,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:45,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:21:45,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598984279] [2022-01-10 00:21:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:45,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:45,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:45,978 INFO L87 Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:46,948 INFO L93 Difference]: Finished difference Result 6586 states and 8545 transitions. [2022-01-10 00:21:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:46,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-01-10 00:21:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:46,960 INFO L225 Difference]: With dead ends: 6586 [2022-01-10 00:21:46,960 INFO L226 Difference]: Without dead ends: 3952 [2022-01-10 00:21:46,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:46,971 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:46,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 00:21:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2022-01-10 00:21:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2022-01-10 00:21:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions. [2022-01-10 00:21:47,022 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 208 [2022-01-10 00:21:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:47,023 INFO L470 AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions. [2022-01-10 00:21:47,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions. [2022-01-10 00:21:47,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-10 00:21:47,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:47,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:21:47,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:21:47,029 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:47,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1951469634, now seen corresponding path program 1 times [2022-01-10 00:21:47,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:47,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933898881] [2022-01-10 00:21:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:47,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:47,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:47,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933898881] [2022-01-10 00:21:47,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933898881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:47,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:47,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:21:47,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888168059] [2022-01-10 00:21:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:47,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:21:47,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:21:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:21:47,252 INFO L87 Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:48,443 INFO L93 Difference]: Finished difference Result 8269 states and 9989 transitions. [2022-01-10 00:21:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:21:48,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2022-01-10 00:21:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:48,455 INFO L225 Difference]: With dead ends: 8269 [2022-01-10 00:21:48,455 INFO L226 Difference]: Without dead ends: 4319 [2022-01-10 00:21:48,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:21:48,459 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 175 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:48,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 371 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 00:21:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2022-01-10 00:21:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4281. [2022-01-10 00:21:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2011682242990653) internal successors, (5141), 4280 states have internal predecessors, (5141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5141 transitions. [2022-01-10 00:21:48,514 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5141 transitions. Word has length 256 [2022-01-10 00:21:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:48,515 INFO L470 AbstractCegarLoop]: Abstraction has 4281 states and 5141 transitions. [2022-01-10 00:21:48,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5141 transitions. [2022-01-10 00:21:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2022-01-10 00:21:48,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:48,518 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:48,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:21:48,518 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:48,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -222992116, now seen corresponding path program 1 times [2022-01-10 00:21:48,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:48,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718375548] [2022-01-10 00:21:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:48,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:48,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:48,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718375548] [2022-01-10 00:21:48,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718375548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:48,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:48,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:21:48,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028039056] [2022-01-10 00:21:48,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:48,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:21:48,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:21:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:21:48,718 INFO L87 Difference]: Start difference. First operand 4281 states and 5141 transitions. Second operand has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:50,071 INFO L93 Difference]: Finished difference Result 8090 states and 9792 transitions. [2022-01-10 00:21:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:21:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2022-01-10 00:21:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:50,096 INFO L225 Difference]: With dead ends: 8090 [2022-01-10 00:21:50,096 INFO L226 Difference]: Without dead ends: 3952 [2022-01-10 00:21:50,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:21:50,101 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 392 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:50,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 286 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 00:21:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2022-01-10 00:21:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2022-01-10 00:21:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0802328524424196) internal successors, (4268), 3951 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4268 transitions. [2022-01-10 00:21:50,168 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4268 transitions. Word has length 343 [2022-01-10 00:21:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:50,169 INFO L470 AbstractCegarLoop]: Abstraction has 3952 states and 4268 transitions. [2022-01-10 00:21:50,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4268 transitions. [2022-01-10 00:21:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2022-01-10 00:21:50,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:50,173 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:50,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:21:50,173 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2002111780, now seen corresponding path program 1 times [2022-01-10 00:21:50,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188692113] [2022-01-10 00:21:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:50,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-01-10 00:21:50,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:50,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188692113] [2022-01-10 00:21:50,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188692113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:50,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:50,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:21:50,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839059269] [2022-01-10 00:21:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:50,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:50,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:50,310 INFO L87 Difference]: Start difference. First operand 3952 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:51,148 INFO L93 Difference]: Finished difference Result 9547 states and 10414 transitions. [2022-01-10 00:21:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2022-01-10 00:21:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:51,174 INFO L225 Difference]: With dead ends: 9547 [2022-01-10 00:21:51,174 INFO L226 Difference]: Without dead ends: 5926 [2022-01-10 00:21:51,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:51,179 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 338 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:51,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:21:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2022-01-10 00:21:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2022-01-10 00:21:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.0828691983122363) internal successors, (6416), 5925 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6416 transitions. [2022-01-10 00:21:51,250 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6416 transitions. Word has length 350 [2022-01-10 00:21:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:51,251 INFO L470 AbstractCegarLoop]: Abstraction has 5926 states and 6416 transitions. [2022-01-10 00:21:51,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6416 transitions. [2022-01-10 00:21:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2022-01-10 00:21:51,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:51,255 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:51,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:21:51,256 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 467844702, now seen corresponding path program 1 times [2022-01-10 00:21:51,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987284022] [2022-01-10 00:21:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:51,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-01-10 00:21:51,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:51,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987284022] [2022-01-10 00:21:51,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987284022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:51,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:51,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:21:51,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580031995] [2022-01-10 00:21:51,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:51,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:51,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:51,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:51,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:51,417 INFO L87 Difference]: Start difference. First operand 5926 states and 6416 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:52,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:52,178 INFO L93 Difference]: Finished difference Result 13495 states and 14710 transitions. [2022-01-10 00:21:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 467 [2022-01-10 00:21:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:52,205 INFO L225 Difference]: With dead ends: 13495 [2022-01-10 00:21:52,205 INFO L226 Difference]: Without dead ends: 7900 [2022-01-10 00:21:52,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:52,211 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 322 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:52,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 440 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:21:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2022-01-10 00:21:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7571. [2022-01-10 00:21:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 7570 states have (on average 1.070541611624835) internal successors, (8104), 7570 states have internal predecessors, (8104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8104 transitions. [2022-01-10 00:21:52,308 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8104 transitions. Word has length 467 [2022-01-10 00:21:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:52,309 INFO L470 AbstractCegarLoop]: Abstraction has 7571 states and 8104 transitions. [2022-01-10 00:21:52,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8104 transitions. [2022-01-10 00:21:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2022-01-10 00:21:52,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:52,315 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:52,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:21:52,316 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash -888558466, now seen corresponding path program 1 times [2022-01-10 00:21:52,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:52,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888155942] [2022-01-10 00:21:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:52,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 17 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:21:52,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888155942] [2022-01-10 00:21:52,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888155942] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:21:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341760693] [2022-01-10 00:21:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:52,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:21:52,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:21:52,574 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) [2022-01-10 00:21:52,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:21:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:52,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:21:52,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:21:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2022-01-10 00:21:53,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:21:53,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341760693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:53,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:21:53,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-01-10 00:21:53,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081006106] [2022-01-10 00:21:53,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:53,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:53,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:21:53,744 INFO L87 Difference]: Start difference. First operand 7571 states and 8104 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:54,410 INFO L93 Difference]: Finished difference Result 9547 states and 10132 transitions. [2022-01-10 00:21:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 534 [2022-01-10 00:21:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:54,425 INFO L225 Difference]: With dead ends: 9547 [2022-01-10 00:21:54,425 INFO L226 Difference]: Without dead ends: 9545 [2022-01-10 00:21:54,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:21:54,428 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:54,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:21:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2022-01-10 00:21:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 7900. [2022-01-10 00:21:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0692492720597544) internal successors, (8446), 7899 states have internal predecessors, (8446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8446 transitions. [2022-01-10 00:21:54,512 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8446 transitions. Word has length 534 [2022-01-10 00:21:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:54,512 INFO L470 AbstractCegarLoop]: Abstraction has 7900 states and 8446 transitions. [2022-01-10 00:21:54,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8446 transitions. [2022-01-10 00:21:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2022-01-10 00:21:54,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:54,532 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:54,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 00:21:54,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:21:54,748 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1288005017, now seen corresponding path program 1 times [2022-01-10 00:21:54,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:54,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715368921] [2022-01-10 00:21:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:54,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1504 backedges. 791 proven. 0 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2022-01-10 00:21:55,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:55,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715368921] [2022-01-10 00:21:55,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715368921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:55,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:55,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:21:55,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073893240] [2022-01-10 00:21:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:55,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:55,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:55,020 INFO L87 Difference]: Start difference. First operand 7900 states and 8446 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 2 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:55,666 INFO L93 Difference]: Finished difference Result 15798 states and 16896 transitions. [2022-01-10 00:21:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 2 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 880 [2022-01-10 00:21:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:55,683 INFO L225 Difference]: With dead ends: 15798 [2022-01-10 00:21:55,683 INFO L226 Difference]: Without dead ends: 8229 [2022-01-10 00:21:55,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:55,690 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:55,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 110 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:21:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2022-01-10 00:21:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2022-01-10 00:21:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0673310646572678) internal successors, (8782), 8228 states have internal predecessors, (8782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8782 transitions. [2022-01-10 00:21:55,767 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8782 transitions. Word has length 880 [2022-01-10 00:21:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:55,767 INFO L470 AbstractCegarLoop]: Abstraction has 8229 states and 8782 transitions. [2022-01-10 00:21:55,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 2 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8782 transitions. [2022-01-10 00:21:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2022-01-10 00:21:55,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:55,778 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:21:55,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:21:55,778 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash -564287955, now seen corresponding path program 1 times [2022-01-10 00:21:55,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:55,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940595855] [2022-01-10 00:21:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:55,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 843 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2022-01-10 00:21:56,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940595855] [2022-01-10 00:21:56,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940595855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:56,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:56,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:21:56,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349500144] [2022-01-10 00:21:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:56,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:21:56,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:21:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:56,045 INFO L87 Difference]: Start difference. First operand 8229 states and 8782 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:56,722 INFO L93 Difference]: Finished difference Result 20075 states and 21560 transitions. [2022-01-10 00:21:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:21:56,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 888 [2022-01-10 00:21:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:56,735 INFO L225 Difference]: With dead ends: 20075 [2022-01-10 00:21:56,735 INFO L226 Difference]: Without dead ends: 10861 [2022-01-10 00:21:56,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:21:56,744 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:56,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:21:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2022-01-10 00:21:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2022-01-10 00:21:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0554327808471455) internal successors, (11462), 10860 states have internal predecessors, (11462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11462 transitions. [2022-01-10 00:21:56,839 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11462 transitions. Word has length 888 [2022-01-10 00:21:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:56,839 INFO L470 AbstractCegarLoop]: Abstraction has 10861 states and 11462 transitions. [2022-01-10 00:21:56,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11462 transitions. [2022-01-10 00:21:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2022-01-10 00:21:56,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:56,858 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:21:56,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 00:21:56,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -513873675, now seen corresponding path program 1 times [2022-01-10 00:21:56,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203647391] [2022-01-10 00:21:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:56,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2475 backedges. 1730 proven. 0 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-01-10 00:21:57,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:57,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203647391] [2022-01-10 00:21:57,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203647391] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:57,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:57,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:21:57,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687083663] [2022-01-10 00:21:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:57,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:21:57,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:57,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:21:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:21:57,251 INFO L87 Difference]: Start difference. First operand 10861 states and 11462 transitions. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:21:58,414 INFO L93 Difference]: Finished difference Result 21811 states and 23031 transitions. [2022-01-10 00:21:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:21:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1183 [2022-01-10 00:21:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:21:58,431 INFO L225 Difference]: With dead ends: 21811 [2022-01-10 00:21:58,431 INFO L226 Difference]: Without dead ends: 11610 [2022-01-10 00:21:58,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:21:58,441 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 319 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:21:58,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 580 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 00:21:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11610 states. [2022-01-10 00:21:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11610 to 11519. [2022-01-10 00:21:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.05270012154888) internal successors, (12125), 11518 states have internal predecessors, (12125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12125 transitions. [2022-01-10 00:21:58,557 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12125 transitions. Word has length 1183 [2022-01-10 00:21:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:21:58,558 INFO L470 AbstractCegarLoop]: Abstraction has 11519 states and 12125 transitions. [2022-01-10 00:21:58,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:21:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12125 transitions. [2022-01-10 00:21:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2022-01-10 00:21:58,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:21:58,624 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:21:58,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:21:58,624 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:21:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:21:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash -187353555, now seen corresponding path program 1 times [2022-01-10 00:21:58,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:21:58,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850308420] [2022-01-10 00:21:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:21:58,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:21:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:21:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2371 backedges. 1663 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2022-01-10 00:21:59,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:21:59,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850308420] [2022-01-10 00:21:59,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850308420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:21:59,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:21:59,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:21:59,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876778199] [2022-01-10 00:21:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:21:59,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:21:59,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:21:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:21:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:21:59,068 INFO L87 Difference]: Start difference. First operand 11519 states and 12125 transitions. Second operand has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:00,522 INFO L93 Difference]: Finished difference Result 23045 states and 24279 transitions. [2022-01-10 00:22:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:22:00,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1197 [2022-01-10 00:22:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:00,536 INFO L225 Difference]: With dead ends: 23045 [2022-01-10 00:22:00,536 INFO L226 Difference]: Without dead ends: 12186 [2022-01-10 00:22:00,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:22:00,543 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 599 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:00,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [599 Valid, 448 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 00:22:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2022-01-10 00:22:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 11848. [2022-01-10 00:22:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0524183337553812) internal successors, (12468), 11847 states have internal predecessors, (12468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12468 transitions. [2022-01-10 00:22:00,635 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12468 transitions. Word has length 1197 [2022-01-10 00:22:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:00,636 INFO L470 AbstractCegarLoop]: Abstraction has 11848 states and 12468 transitions. [2022-01-10 00:22:00,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:00,636 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12468 transitions. [2022-01-10 00:22:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2022-01-10 00:22:00,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:00,654 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:22:00,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:22:00,654 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:00,654 INFO L85 PathProgramCache]: Analyzing trace with hash 571752054, now seen corresponding path program 1 times [2022-01-10 00:22:00,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:00,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480568450] [2022-01-10 00:22:00,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:00,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 857 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2022-01-10 00:22:00,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:00,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480568450] [2022-01-10 00:22:00,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480568450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:00,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:22:00,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:22:00,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467998546] [2022-01-10 00:22:00,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:00,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:00,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:00,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:00,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:00,966 INFO L87 Difference]: Start difference. First operand 11848 states and 12468 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:01,681 INFO L93 Difference]: Finished difference Result 25668 states and 27078 transitions. [2022-01-10 00:22:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1199 [2022-01-10 00:22:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:01,698 INFO L225 Difference]: With dead ends: 25668 [2022-01-10 00:22:01,698 INFO L226 Difference]: Without dead ends: 13164 [2022-01-10 00:22:01,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:01,709 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:01,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 414 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2022-01-10 00:22:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2022-01-10 00:22:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0411760237028034) internal successors, (13705), 13163 states have internal predecessors, (13705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13705 transitions. [2022-01-10 00:22:01,825 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13705 transitions. Word has length 1199 [2022-01-10 00:22:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:01,826 INFO L470 AbstractCegarLoop]: Abstraction has 13164 states and 13705 transitions. [2022-01-10 00:22:01,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13705 transitions. [2022-01-10 00:22:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1332 [2022-01-10 00:22:01,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:01,845 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:22:01,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:22:01,845 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash -179752077, now seen corresponding path program 1 times [2022-01-10 00:22:01,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:01,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182766350] [2022-01-10 00:22:01,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:01,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3590 backedges. 2416 proven. 0 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2022-01-10 00:22:02,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:02,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182766350] [2022-01-10 00:22:02,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182766350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:02,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:22:02,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:22:02,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134113452] [2022-01-10 00:22:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:02,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:02,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:02,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:02,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:02,124 INFO L87 Difference]: Start difference. First operand 13164 states and 13705 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:02,870 INFO L93 Difference]: Finished difference Result 25668 states and 26741 transitions. [2022-01-10 00:22:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:02,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1331 [2022-01-10 00:22:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:02,883 INFO L225 Difference]: With dead ends: 25668 [2022-01-10 00:22:02,884 INFO L226 Difference]: Without dead ends: 13164 [2022-01-10 00:22:02,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:02,892 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 195 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:02,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 418 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:22:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2022-01-10 00:22:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2022-01-10 00:22:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0319463923952001) internal successors, (13244), 12834 states have internal predecessors, (13244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13244 transitions. [2022-01-10 00:22:02,985 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13244 transitions. Word has length 1331 [2022-01-10 00:22:02,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:02,986 INFO L470 AbstractCegarLoop]: Abstraction has 12835 states and 13244 transitions. [2022-01-10 00:22:02,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13244 transitions. [2022-01-10 00:22:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1357 [2022-01-10 00:22:03,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:03,007 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:22:03,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 00:22:03,008 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1635205947, now seen corresponding path program 1 times [2022-01-10 00:22:03,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:03,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790171867] [2022-01-10 00:22:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:03,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3765 backedges. 2279 proven. 0 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2022-01-10 00:22:03,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:03,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790171867] [2022-01-10 00:22:03,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790171867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:03,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:22:03,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:22:03,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690213344] [2022-01-10 00:22:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:03,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:03,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:03,327 INFO L87 Difference]: Start difference. First operand 12835 states and 13244 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:04,017 INFO L93 Difference]: Finished difference Result 25668 states and 26488 transitions. [2022-01-10 00:22:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1356 [2022-01-10 00:22:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:04,032 INFO L225 Difference]: With dead ends: 25668 [2022-01-10 00:22:04,032 INFO L226 Difference]: Without dead ends: 13493 [2022-01-10 00:22:04,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:04,038 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:04,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 432 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2022-01-10 00:22:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2022-01-10 00:22:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0307589682774978) internal successors, (13907), 13492 states have internal predecessors, (13907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13907 transitions. [2022-01-10 00:22:04,150 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13907 transitions. Word has length 1356 [2022-01-10 00:22:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:04,151 INFO L470 AbstractCegarLoop]: Abstraction has 13493 states and 13907 transitions. [2022-01-10 00:22:04,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13907 transitions. [2022-01-10 00:22:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1411 [2022-01-10 00:22:04,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:04,169 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:22:04,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 00:22:04,169 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -480679732, now seen corresponding path program 1 times [2022-01-10 00:22:04,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985417440] [2022-01-10 00:22:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:04,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3765 backedges. 1037 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2022-01-10 00:22:04,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:04,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985417440] [2022-01-10 00:22:04,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985417440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:04,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:22:04,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:22:04,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700412262] [2022-01-10 00:22:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:04,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:04,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:04,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:04,554 INFO L87 Difference]: Start difference. First operand 13493 states and 13907 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:05,255 INFO L93 Difference]: Finished difference Result 26655 states and 27481 transitions. [2022-01-10 00:22:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:05,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1410 [2022-01-10 00:22:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:05,269 INFO L225 Difference]: With dead ends: 26655 [2022-01-10 00:22:05,269 INFO L226 Difference]: Without dead ends: 13493 [2022-01-10 00:22:05,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:05,277 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 169 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:05,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 371 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2022-01-10 00:22:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2022-01-10 00:22:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0255707085680403) internal successors, (13837), 13492 states have internal predecessors, (13837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13837 transitions. [2022-01-10 00:22:05,391 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13837 transitions. Word has length 1410 [2022-01-10 00:22:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:05,392 INFO L470 AbstractCegarLoop]: Abstraction has 13493 states and 13837 transitions. [2022-01-10 00:22:05,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13837 transitions. [2022-01-10 00:22:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1649 [2022-01-10 00:22:05,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:05,414 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:22:05,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 00:22:05,414 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -461133012, now seen corresponding path program 1 times [2022-01-10 00:22:05,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:05,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352232328] [2022-01-10 00:22:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:05,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5122 backedges. 1875 proven. 1384 refuted. 0 times theorem prover too weak. 1863 trivial. 0 not checked. [2022-01-10 00:22:06,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352232328] [2022-01-10 00:22:06,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352232328] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:22:06,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852899949] [2022-01-10 00:22:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:06,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:06,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:22:06,007 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) [2022-01-10 00:22:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:22:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:06,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:22:06,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:22:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5122 backedges. 2842 proven. 0 refuted. 0 times theorem prover too weak. 2280 trivial. 0 not checked. [2022-01-10 00:22:08,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:22:08,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852899949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:08,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:22:08,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-10 00:22:08,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531093520] [2022-01-10 00:22:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:08,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:08,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:08,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:22:08,581 INFO L87 Difference]: Start difference. First operand 13493 states and 13837 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:09,272 INFO L93 Difference]: Finished difference Result 26326 states and 27007 transitions. [2022-01-10 00:22:09,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:09,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1648 [2022-01-10 00:22:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:09,285 INFO L225 Difference]: With dead ends: 26326 [2022-01-10 00:22:09,286 INFO L226 Difference]: Without dead ends: 13493 [2022-01-10 00:22:09,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1652 GetRequests, 1648 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:22:09,293 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:09,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2022-01-10 00:22:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 12177. [2022-01-10 00:22:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0233245729303548) internal successors, (12460), 12176 states have internal predecessors, (12460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12460 transitions. [2022-01-10 00:22:09,404 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12460 transitions. Word has length 1648 [2022-01-10 00:22:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:09,405 INFO L470 AbstractCegarLoop]: Abstraction has 12177 states and 12460 transitions. [2022-01-10 00:22:09,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12460 transitions. [2022-01-10 00:22:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1739 [2022-01-10 00:22:09,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:09,429 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-01-10 00:22:09,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:22:09,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 00:22:09,646 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1627276631, now seen corresponding path program 1 times [2022-01-10 00:22:09,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:09,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642103058] [2022-01-10 00:22:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:09,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5172 backedges. 3999 proven. 90 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2022-01-10 00:22:10,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642103058] [2022-01-10 00:22:10,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642103058] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:22:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290189098] [2022-01-10 00:22:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:10,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:10,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:22:10,400 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) [2022-01-10 00:22:10,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:22:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:10,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 2021 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 00:22:10,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:22:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5172 backedges. 2316 proven. 201 refuted. 0 times theorem prover too weak. 2655 trivial. 0 not checked. [2022-01-10 00:22:15,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:22:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5172 backedges. 2316 proven. 201 refuted. 0 times theorem prover too weak. 2655 trivial. 0 not checked. [2022-01-10 00:22:21,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290189098] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:22:21,394 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:22:21,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2022-01-10 00:22:21,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496462253] [2022-01-10 00:22:21,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:22:21,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 00:22:21,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 00:22:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:22:21,398 INFO L87 Difference]: Start difference. First operand 12177 states and 12460 transitions. Second operand has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:25,129 INFO L93 Difference]: Finished difference Result 24773 states and 25360 transitions. [2022-01-10 00:22:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 00:22:25,130 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1738 [2022-01-10 00:22:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:25,142 INFO L225 Difference]: With dead ends: 24773 [2022-01-10 00:22:25,142 INFO L226 Difference]: Without dead ends: 13256 [2022-01-10 00:22:25,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3497 GetRequests, 3479 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-01-10 00:22:25,150 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1344 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7930 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 8239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 7930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:25,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1344 Valid, 145 Invalid, 8239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 7930 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-01-10 00:22:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13256 states. [2022-01-10 00:22:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13256 to 12177. [2022-01-10 00:22:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0182325886990802) internal successors, (12398), 12176 states have internal predecessors, (12398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12398 transitions. [2022-01-10 00:22:25,246 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12398 transitions. Word has length 1738 [2022-01-10 00:22:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:25,247 INFO L470 AbstractCegarLoop]: Abstraction has 12177 states and 12398 transitions. [2022-01-10 00:22:25,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 202.8181818181818) internal successors, (2231), 11 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12398 transitions. [2022-01-10 00:22:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1939 [2022-01-10 00:22:25,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:25,274 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:22:25,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:22:25,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:25,489 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:25,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1291563803, now seen corresponding path program 1 times [2022-01-10 00:22:25,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:25,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873441529] [2022-01-10 00:22:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:25,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6650 backedges. 2505 proven. 156 refuted. 0 times theorem prover too weak. 3989 trivial. 0 not checked. [2022-01-10 00:22:26,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:26,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873441529] [2022-01-10 00:22:26,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873441529] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:22:26,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640643974] [2022-01-10 00:22:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:26,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:22:26,040 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) [2022-01-10 00:22:26,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:22:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:26,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:22:26,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:22:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6650 backedges. 2661 proven. 0 refuted. 0 times theorem prover too weak. 3989 trivial. 0 not checked. [2022-01-10 00:22:28,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:22:28,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640643974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:28,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:22:28,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-01-10 00:22:28,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653693143] [2022-01-10 00:22:28,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:28,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:28,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:22:28,955 INFO L87 Difference]: Start difference. First operand 12177 states and 12398 transitions. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:29,679 INFO L93 Difference]: Finished difference Result 25997 states and 26487 transitions. [2022-01-10 00:22:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1938 [2022-01-10 00:22:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:29,690 INFO L225 Difference]: With dead ends: 25997 [2022-01-10 00:22:29,691 INFO L226 Difference]: Without dead ends: 14151 [2022-01-10 00:22:29,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1942 GetRequests, 1937 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:22:29,697 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:29,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 94 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2022-01-10 00:22:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13164. [2022-01-10 00:22:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0173212793436146) internal successors, (13391), 13163 states have internal predecessors, (13391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13391 transitions. [2022-01-10 00:22:29,797 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13391 transitions. Word has length 1938 [2022-01-10 00:22:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:29,797 INFO L470 AbstractCegarLoop]: Abstraction has 13164 states and 13391 transitions. [2022-01-10 00:22:29,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13391 transitions. [2022-01-10 00:22:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2002 [2022-01-10 00:22:29,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:29,825 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:22:29,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:22:30,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:30,030 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:30,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1992641842, now seen corresponding path program 1 times [2022-01-10 00:22:30,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:30,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402570227] [2022-01-10 00:22:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:30,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6968 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6879 trivial. 0 not checked. [2022-01-10 00:22:30,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402570227] [2022-01-10 00:22:30,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402570227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:22:30,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:22:30,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:22:30,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26162755] [2022-01-10 00:22:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:22:30,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:22:30,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:22:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:22:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:30,631 INFO L87 Difference]: Start difference. First operand 13164 states and 13391 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:22:31,332 INFO L93 Difference]: Finished difference Result 30274 states and 30809 transitions. [2022-01-10 00:22:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:22:31,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2001 [2022-01-10 00:22:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:22:31,349 INFO L225 Difference]: With dead ends: 30274 [2022-01-10 00:22:31,350 INFO L226 Difference]: Without dead ends: 17112 [2022-01-10 00:22:31,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:22:31,358 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 326 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:22:31,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 45 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 00:22:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2022-01-10 00:22:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 14151. [2022-01-10 00:22:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.018303886925795) internal successors, (14409), 14150 states have internal predecessors, (14409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14409 transitions. [2022-01-10 00:22:31,480 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14409 transitions. Word has length 2001 [2022-01-10 00:22:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:22:31,481 INFO L470 AbstractCegarLoop]: Abstraction has 14151 states and 14409 transitions. [2022-01-10 00:22:31,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:22:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14409 transitions. [2022-01-10 00:22:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2205 [2022-01-10 00:22:31,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:22:31,549 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:22:31,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 00:22:31,549 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:22:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:22:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1282710524, now seen corresponding path program 1 times [2022-01-10 00:22:31,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:22:31,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270958235] [2022-01-10 00:22:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:31,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:22:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8476 backedges. 4897 proven. 1840 refuted. 0 times theorem prover too weak. 1739 trivial. 0 not checked. [2022-01-10 00:22:32,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:22:32,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270958235] [2022-01-10 00:22:32,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270958235] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:22:32,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669507251] [2022-01-10 00:22:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:22:32,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:22:32,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:22:32,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:22:32,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:22:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:22:32,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 2550 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 00:22:32,750 INFO L286 TraceCheckSpWp]: Computing forward predicates...