/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/Problem17_label58.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:27:03,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:27:03,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:27:03,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:27:03,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:27:03,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:27:03,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:27:03,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:27:03,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:27:03,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:27:03,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:27:03,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:27:03,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:27:03,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:27:03,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:27:03,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:27:03,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:27:03,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:27:03,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:27:03,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:27:03,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:27:03,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:27:03,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:27:03,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:27:03,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:27:03,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:27:03,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:27:03,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:27:03,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:27:03,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:27:03,715 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:27:03,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:27:03,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:27:03,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:27:03,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:27:03,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:27:03,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:27:03,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:27:03,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:27:03,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:27:03,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:27:03,720 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:27:03,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:27:03,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:27:03,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:27:03,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:27:03,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:27:03,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:27:03,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:27:03,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:27:03,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:27:03,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:27:03,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:27:03,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:27:03,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:27:03,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:27:03,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:27:03,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:27:03,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:27:03,740 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:27:03,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:27:03,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:27:03,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:27:03,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:27:03,911 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:27:03,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label58.c [2022-01-10 00:27:03,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d751b1a9/5d1840ca436d4413be97d585fffd673d/FLAG069f27e3e [2022-01-10 00:27:04,388 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:27:04,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label58.c [2022-01-10 00:27:04,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d751b1a9/5d1840ca436d4413be97d585fffd673d/FLAG069f27e3e [2022-01-10 00:27:04,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d751b1a9/5d1840ca436d4413be97d585fffd673d [2022-01-10 00:27:04,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:27:04,697 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:27:04,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:27:04,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:27:04,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:27:04,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:27:04" (1/1) ... [2022-01-10 00:27:04,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@276b839d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:04, skipping insertion in model container [2022-01-10 00:27:04,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:27:04" (1/1) ... [2022-01-10 00:27:04,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:27:04,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:27:05,013 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/Problem17_label58.c[6741,6754] [2022-01-10 00:27:05,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:27:05,396 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:27:05,421 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/Problem17_label58.c[6741,6754] [2022-01-10 00:27:05,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:27:05,645 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:27:05,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05 WrapperNode [2022-01-10 00:27:05,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:27:05,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:27:05,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:27:05,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:27:05,653 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:27:05" (1/1) ... [2022-01-10 00:27:05,689 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:27:05" (1/1) ... [2022-01-10 00:27:05,998 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2611 [2022-01-10 00:27:05,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:27:05,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:27:05,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:27:05,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:27:06,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:27:06,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:27:06,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:27:06,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:27:06,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (1/1) ... [2022-01-10 00:27:06,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:27:06,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:27:06,381 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:27:06,397 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:27:06,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:27:06,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:27:06,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:27:06,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:27:06,506 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:27:06,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:27:08,739 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:27:08,752 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:27:08,753 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:27:08,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:27:08 BoogieIcfgContainer [2022-01-10 00:27:08,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:27:08,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:27:08,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:27:08,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:27:08,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:27:04" (1/3) ... [2022-01-10 00:27:08,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:27:08, skipping insertion in model container [2022-01-10 00:27:08,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:27:05" (2/3) ... [2022-01-10 00:27:08,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:27:08, skipping insertion in model container [2022-01-10 00:27:08,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:27:08" (3/3) ... [2022-01-10 00:27:08,761 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2022-01-10 00:27:08,764 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:27:08,764 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:27:08,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:27:08,817 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:27:08,818 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:27:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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:27:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 00:27:08,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:08,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:08,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2022-01-10 00:27:08,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792240777] [2022-01-10 00:27:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:08,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:09,103 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:27:09,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792240777] [2022-01-10 00:27:09,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792240777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:09,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:09,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:27:09,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593395021] [2022-01-10 00:27:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:09,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:09,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:09,130 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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:27:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:11,609 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2022-01-10 00:27:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:11,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 45 [2022-01-10 00:27:11,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:11,624 INFO L225 Difference]: With dead ends: 1667 [2022-01-10 00:27:11,624 INFO L226 Difference]: Without dead ends: 998 [2022-01-10 00:27:11,628 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:27:11,630 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:11,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [500 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 00:27:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-01-10 00:27:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2022-01-10 00:27:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 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:27:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2022-01-10 00:27:11,693 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 45 [2022-01-10 00:27:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:11,694 INFO L470 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2022-01-10 00:27:11,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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:27:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2022-01-10 00:27:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 00:27:11,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:11,696 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:27:11,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:27:11,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1676282541, now seen corresponding path program 1 times [2022-01-10 00:27:11,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:11,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097500429] [2022-01-10 00:27:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:11,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:11,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:11,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097500429] [2022-01-10 00:27:11,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097500429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:11,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:11,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:27:11,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872124093] [2022-01-10 00:27:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:11,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:11,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:11,813 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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:27:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:13,713 INFO L93 Difference]: Finished difference Result 2843 states and 4882 transitions. [2022-01-10 00:27:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2022-01-10 00:27:13,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:13,722 INFO L225 Difference]: With dead ends: 2843 [2022-01-10 00:27:13,723 INFO L226 Difference]: Without dead ends: 1863 [2022-01-10 00:27:13,729 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:27:13,731 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 409 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:13,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 495 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 00:27:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-01-10 00:27:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1857. [2022-01-10 00:27:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4552801724137931) internal successors, (2701), 1856 states have internal predecessors, (2701), 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:27:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2701 transitions. [2022-01-10 00:27:13,774 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2701 transitions. Word has length 110 [2022-01-10 00:27:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:13,777 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 2701 transitions. [2022-01-10 00:27:13,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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:27:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2701 transitions. [2022-01-10 00:27:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 00:27:13,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:13,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:27:13,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:27:13,785 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -690077156, now seen corresponding path program 1 times [2022-01-10 00:27:13,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:13,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025377493] [2022-01-10 00:27:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:13,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:13,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:13,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025377493] [2022-01-10 00:27:13,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025377493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:13,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:13,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:27:13,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501220802] [2022-01-10 00:27:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:13,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:13,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:13,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:13,908 INFO L87 Difference]: Start difference. First operand 1857 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:27:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:15,505 INFO L93 Difference]: Finished difference Result 5425 states and 7895 transitions. [2022-01-10 00:27:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2022-01-10 00:27:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:15,543 INFO L225 Difference]: With dead ends: 5425 [2022-01-10 00:27:15,543 INFO L226 Difference]: Without dead ends: 3570 [2022-01-10 00:27:15,546 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:27:15,558 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:15,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 00:27:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2022-01-10 00:27:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2714. [2022-01-10 00:27:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.315886472539624) internal successors, (3570), 2713 states have internal predecessors, (3570), 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:27:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3570 transitions. [2022-01-10 00:27:15,615 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3570 transitions. Word has length 116 [2022-01-10 00:27:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:15,615 INFO L470 AbstractCegarLoop]: Abstraction has 2714 states and 3570 transitions. [2022-01-10 00:27:15,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:27:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3570 transitions. [2022-01-10 00:27:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-10 00:27:15,617 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:15,617 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 00:27:15,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:27:15,617 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:15,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:15,618 INFO L85 PathProgramCache]: Analyzing trace with hash 544079772, now seen corresponding path program 1 times [2022-01-10 00:27:15,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:15,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279101518] [2022-01-10 00:27:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:15,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:15,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:15,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279101518] [2022-01-10 00:27:15,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279101518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:15,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:15,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:27:15,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708267284] [2022-01-10 00:27:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:15,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:27:15,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:27:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:27:15,715 INFO L87 Difference]: Start difference. First operand 2714 states and 3570 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 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:27:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:17,788 INFO L93 Difference]: Finished difference Result 7159 states and 9653 transitions. [2022-01-10 00:27:17,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:27:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 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 193 [2022-01-10 00:27:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:17,800 INFO L225 Difference]: With dead ends: 7159 [2022-01-10 00:27:17,800 INFO L226 Difference]: Without dead ends: 4447 [2022-01-10 00:27:17,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:27:17,809 INFO L933 BasicCegarLoop]: 756 mSDtfsCounter, 1658 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:17,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1658 Valid, 843 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 00:27:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-01-10 00:27:17,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4424. [2022-01-10 00:27:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 4423 states have (on average 1.2912050644359032) internal successors, (5711), 4423 states have internal predecessors, (5711), 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:27:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 5711 transitions. [2022-01-10 00:27:17,874 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 5711 transitions. Word has length 193 [2022-01-10 00:27:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:17,875 INFO L470 AbstractCegarLoop]: Abstraction has 4424 states and 5711 transitions. [2022-01-10 00:27:17,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 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:27:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 5711 transitions. [2022-01-10 00:27:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-10 00:27:17,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:17,878 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 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] [2022-01-10 00:27:17,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:27:17,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1198749749, now seen corresponding path program 1 times [2022-01-10 00:27:17,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:17,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017256202] [2022-01-10 00:27:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:17,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-01-10 00:27:18,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:18,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017256202] [2022-01-10 00:27:18,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017256202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:18,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:18,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:18,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630040057] [2022-01-10 00:27:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:18,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:18,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:18,018 INFO L87 Difference]: Start difference. First operand 4424 states and 5711 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:27:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:19,902 INFO L93 Difference]: Finished difference Result 10593 states and 13804 transitions. [2022-01-10 00:27:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 199 [2022-01-10 00:27:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:19,924 INFO L225 Difference]: With dead ends: 10593 [2022-01-10 00:27:19,924 INFO L226 Difference]: Without dead ends: 6171 [2022-01-10 00:27:19,930 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:27:19,931 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 508 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:19,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 240 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 00:27:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2022-01-10 00:27:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6153. [2022-01-10 00:27:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6152 states have (on average 1.303966189856957) internal successors, (8022), 6152 states have internal predecessors, (8022), 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:27:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8022 transitions. [2022-01-10 00:27:20,020 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8022 transitions. Word has length 199 [2022-01-10 00:27:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:20,020 INFO L470 AbstractCegarLoop]: Abstraction has 6153 states and 8022 transitions. [2022-01-10 00:27:20,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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:27:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8022 transitions. [2022-01-10 00:27:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-01-10 00:27:20,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:20,024 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:27:20,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:27:20,025 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:20,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -654017339, now seen corresponding path program 1 times [2022-01-10 00:27:20,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:20,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059968805] [2022-01-10 00:27:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:20,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:20,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059968805] [2022-01-10 00:27:20,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059968805] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:27:20,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541338867] [2022-01-10 00:27:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:20,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:27:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:27:20,242 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:27:20,265 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:27:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:20,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:27:20,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:27:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:21,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:27:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:21,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541338867] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 00:27:21,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:27:21,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2022-01-10 00:27:21,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448639625] [2022-01-10 00:27:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:21,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:27:21,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:27:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:27:21,463 INFO L87 Difference]: Start difference. First operand 6153 states and 8022 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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:27:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:24,452 INFO L93 Difference]: Finished difference Result 19997 states and 26780 transitions. [2022-01-10 00:27:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:27:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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 265 [2022-01-10 00:27:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:24,502 INFO L225 Difference]: With dead ends: 19997 [2022-01-10 00:27:24,502 INFO L226 Difference]: Without dead ends: 12537 [2022-01-10 00:27:24,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 525 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:27:24,510 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 1056 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1396 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:24,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 153 Invalid, 3689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1396 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-01-10 00:27:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2022-01-10 00:27:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 12531. [2022-01-10 00:27:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12531 states, 12530 states have (on average 1.2289704708699123) internal successors, (15399), 12530 states have internal predecessors, (15399), 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:27:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12531 states to 12531 states and 15399 transitions. [2022-01-10 00:27:24,698 INFO L78 Accepts]: Start accepts. Automaton has 12531 states and 15399 transitions. Word has length 265 [2022-01-10 00:27:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:24,699 INFO L470 AbstractCegarLoop]: Abstraction has 12531 states and 15399 transitions. [2022-01-10 00:27:24,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 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:27:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12531 states and 15399 transitions. [2022-01-10 00:27:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-01-10 00:27:24,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:24,703 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 00:27:24,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:27:24,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 00:27:24,920 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:24,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash -925800976, now seen corresponding path program 1 times [2022-01-10 00:27:24,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:24,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273135913] [2022-01-10 00:27:24,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:24,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 00:27:25,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:25,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273135913] [2022-01-10 00:27:25,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273135913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:25,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:25,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:25,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477951900] [2022-01-10 00:27:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:25,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:25,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:25,042 INFO L87 Difference]: Start difference. First operand 12531 states and 15399 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:27:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:26,730 INFO L93 Difference]: Finished difference Result 30195 states and 36859 transitions. [2022-01-10 00:27:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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 302 [2022-01-10 00:27:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:26,786 INFO L225 Difference]: With dead ends: 30195 [2022-01-10 00:27:26,786 INFO L226 Difference]: Without dead ends: 16816 [2022-01-10 00:27:26,800 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:27:26,801 INFO L933 BasicCegarLoop]: 791 mSDtfsCounter, 413 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:26,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 859 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 00:27:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16816 states. [2022-01-10 00:27:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16816 to 16805. [2022-01-10 00:27:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16805 states, 16804 states have (on average 1.1906688883599144) internal successors, (20008), 16804 states have internal predecessors, (20008), 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:27:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16805 states to 16805 states and 20008 transitions. [2022-01-10 00:27:27,161 INFO L78 Accepts]: Start accepts. Automaton has 16805 states and 20008 transitions. Word has length 302 [2022-01-10 00:27:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:27,162 INFO L470 AbstractCegarLoop]: Abstraction has 16805 states and 20008 transitions. [2022-01-10 00:27:27,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:27:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 16805 states and 20008 transitions. [2022-01-10 00:27:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2022-01-10 00:27:27,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:27,167 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 00:27:27,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:27:27,167 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1794999384, now seen corresponding path program 1 times [2022-01-10 00:27:27,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:27,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029814540] [2022-01-10 00:27:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:27,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 00:27:27,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029814540] [2022-01-10 00:27:27,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029814540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:27,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:27,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:27,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213327179] [2022-01-10 00:27:27,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:27,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:27,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:27,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:27,379 INFO L87 Difference]: Start difference. First operand 16805 states and 20008 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:27:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:29,036 INFO L93 Difference]: Finished difference Result 40835 states and 48524 transitions. [2022-01-10 00:27:29,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:29,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 348 [2022-01-10 00:27:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:29,072 INFO L225 Difference]: With dead ends: 40835 [2022-01-10 00:27:29,072 INFO L226 Difference]: Without dead ends: 21900 [2022-01-10 00:27:29,111 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:27:29,111 INFO L933 BasicCegarLoop]: 749 mSDtfsCounter, 374 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:29,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [374 Valid, 810 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 00:27:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21900 states. [2022-01-10 00:27:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21900 to 21894. [2022-01-10 00:27:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21894 states, 21893 states have (on average 1.1318229571095784) internal successors, (24779), 21893 states have internal predecessors, (24779), 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:27:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21894 states to 21894 states and 24779 transitions. [2022-01-10 00:27:29,370 INFO L78 Accepts]: Start accepts. Automaton has 21894 states and 24779 transitions. Word has length 348 [2022-01-10 00:27:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:29,370 INFO L470 AbstractCegarLoop]: Abstraction has 21894 states and 24779 transitions. [2022-01-10 00:27:29,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:27:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21894 states and 24779 transitions. [2022-01-10 00:27:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-01-10 00:27:29,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:29,377 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 00:27:29,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:27:29,378 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1446279023, now seen corresponding path program 1 times [2022-01-10 00:27:29,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:29,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835373966] [2022-01-10 00:27:29,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:29,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 00:27:29,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:29,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835373966] [2022-01-10 00:27:29,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835373966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:29,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:29,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:29,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675038191] [2022-01-10 00:27:29,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:29,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:29,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:29,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:29,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:29,524 INFO L87 Difference]: Start difference. First operand 21894 states and 24779 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:27:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:30,891 INFO L93 Difference]: Finished difference Result 48460 states and 55073 transitions. [2022-01-10 00:27:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 373 [2022-01-10 00:27:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:30,928 INFO L225 Difference]: With dead ends: 48460 [2022-01-10 00:27:30,928 INFO L226 Difference]: Without dead ends: 26568 [2022-01-10 00:27:30,948 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:27:30,950 INFO L933 BasicCegarLoop]: 729 mSDtfsCounter, 369 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:30,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 790 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 00:27:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26568 states. [2022-01-10 00:27:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26568 to 26568. [2022-01-10 00:27:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26568 states, 26567 states have (on average 1.1179658975420634) internal successors, (29701), 26567 states have internal predecessors, (29701), 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:27:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26568 states to 26568 states and 29701 transitions. [2022-01-10 00:27:31,329 INFO L78 Accepts]: Start accepts. Automaton has 26568 states and 29701 transitions. Word has length 373 [2022-01-10 00:27:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:31,329 INFO L470 AbstractCegarLoop]: Abstraction has 26568 states and 29701 transitions. [2022-01-10 00:27:31,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:27:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 26568 states and 29701 transitions. [2022-01-10 00:27:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2022-01-10 00:27:31,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:31,337 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 00:27:31,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:27:31,338 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1440550631, now seen corresponding path program 1 times [2022-01-10 00:27:31,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:31,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266847918] [2022-01-10 00:27:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:31,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-10 00:27:31,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266847918] [2022-01-10 00:27:31,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266847918] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:31,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:31,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:31,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968832453] [2022-01-10 00:27:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:31,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:31,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:31,502 INFO L87 Difference]: Start difference. First operand 26568 states and 29701 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:27:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:33,199 INFO L93 Difference]: Finished difference Result 64200 states and 72104 transitions. [2022-01-10 00:27:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 383 [2022-01-10 00:27:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:33,236 INFO L225 Difference]: With dead ends: 64200 [2022-01-10 00:27:33,236 INFO L226 Difference]: Without dead ends: 35082 [2022-01-10 00:27:33,254 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:27:33,255 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 288 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:33,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 742 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 00:27:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35082 states. [2022-01-10 00:27:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35082 to 29531. [2022-01-10 00:27:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29531 states, 29530 states have (on average 1.1009820521503555) internal successors, (32512), 29530 states have internal predecessors, (32512), 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:27:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29531 states to 29531 states and 32512 transitions. [2022-01-10 00:27:33,630 INFO L78 Accepts]: Start accepts. Automaton has 29531 states and 32512 transitions. Word has length 383 [2022-01-10 00:27:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:33,630 INFO L470 AbstractCegarLoop]: Abstraction has 29531 states and 32512 transitions. [2022-01-10 00:27:33,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:27:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29531 states and 32512 transitions. [2022-01-10 00:27:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-01-10 00:27:33,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:33,637 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 00:27:33,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:27:33,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1027671709, now seen corresponding path program 1 times [2022-01-10 00:27:33,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:33,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804652018] [2022-01-10 00:27:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:33,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-01-10 00:27:33,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804652018] [2022-01-10 00:27:33,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804652018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:33,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:33,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:33,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29348116] [2022-01-10 00:27:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:33,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:33,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:33,750 INFO L87 Difference]: Start difference. First operand 29531 states and 32512 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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:27:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:35,719 INFO L93 Difference]: Finished difference Result 67601 states and 74480 transitions. [2022-01-10 00:27:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:35,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 408 [2022-01-10 00:27:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:35,760 INFO L225 Difference]: With dead ends: 67601 [2022-01-10 00:27:35,761 INFO L226 Difference]: Without dead ends: 38072 [2022-01-10 00:27:35,800 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:27:35,806 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 466 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:35,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 169 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 00:27:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38072 states. [2022-01-10 00:27:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38072 to 29954. [2022-01-10 00:27:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29954 states, 29953 states have (on average 1.100557540146229) internal successors, (32965), 29953 states have internal predecessors, (32965), 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:27:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29954 states to 29954 states and 32965 transitions. [2022-01-10 00:27:36,456 INFO L78 Accepts]: Start accepts. Automaton has 29954 states and 32965 transitions. Word has length 408 [2022-01-10 00:27:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:36,457 INFO L470 AbstractCegarLoop]: Abstraction has 29954 states and 32965 transitions. [2022-01-10 00:27:36,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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:27:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29954 states and 32965 transitions. [2022-01-10 00:27:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2022-01-10 00:27:36,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:36,507 INFO L514 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:36,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 00:27:36,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1665160821, now seen corresponding path program 1 times [2022-01-10 00:27:36,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:36,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651395510] [2022-01-10 00:27:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:36,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:36,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651395510] [2022-01-10 00:27:36,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651395510] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:27:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322624296] [2022-01-10 00:27:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:36,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:27:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:27:36,971 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:27:36,973 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:27:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:37,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 00:27:37,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:27:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:38,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:27:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 316 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:27:38,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322624296] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:27:38,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:27:38,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 00:27:38,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095560049] [2022-01-10 00:27:38,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:27:38,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 00:27:38,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 00:27:38,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:27:38,945 INFO L87 Difference]: Start difference. First operand 29954 states and 32965 transitions. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 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:27:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:44,201 INFO L93 Difference]: Finished difference Result 88887 states and 97579 transitions. [2022-01-10 00:27:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:27:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 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 519 [2022-01-10 00:27:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:44,255 INFO L225 Difference]: With dead ends: 88887 [2022-01-10 00:27:44,256 INFO L226 Difference]: Without dead ends: 57660 [2022-01-10 00:27:44,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 1031 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:27:44,272 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 4059 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 7324 mSolverCounterSat, 852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4059 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 8176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 7324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:44,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4059 Valid, 408 Invalid, 8176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 7324 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-01-10 00:27:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57660 states. [2022-01-10 00:27:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57660 to 36362. [2022-01-10 00:27:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36362 states, 36361 states have (on average 1.0971920464233658) internal successors, (39895), 36361 states have internal predecessors, (39895), 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:27:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36362 states to 36362 states and 39895 transitions. [2022-01-10 00:27:44,793 INFO L78 Accepts]: Start accepts. Automaton has 36362 states and 39895 transitions. Word has length 519 [2022-01-10 00:27:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:44,794 INFO L470 AbstractCegarLoop]: Abstraction has 36362 states and 39895 transitions. [2022-01-10 00:27:44,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 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:27:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36362 states and 39895 transitions. [2022-01-10 00:27:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2022-01-10 00:27:44,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:44,853 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:44,871 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:27:45,069 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,SelfDestructingSolverStorable11 [2022-01-10 00:27:45,070 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:45,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1435012347, now seen corresponding path program 1 times [2022-01-10 00:27:45,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785579430] [2022-01-10 00:27:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:45,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-01-10 00:27:45,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785579430] [2022-01-10 00:27:45,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785579430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:45,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:45,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:27:45,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862543941] [2022-01-10 00:27:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:45,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:45,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:45,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:45,538 INFO L87 Difference]: Start difference. First operand 36362 states and 39895 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 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:27:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:46,464 INFO L93 Difference]: Finished difference Result 71439 states and 78401 transitions. [2022-01-10 00:27:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:46,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 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 635 [2022-01-10 00:27:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:46,497 INFO L225 Difference]: With dead ends: 71439 [2022-01-10 00:27:46,497 INFO L226 Difference]: Without dead ends: 35503 [2022-01-10 00:27:46,518 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:27:46,519 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 413 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:46,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 104 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 00:27:46,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35503 states. [2022-01-10 00:27:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35503 to 35497. [2022-01-10 00:27:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35497 states, 35496 states have (on average 1.0962361956276763) internal successors, (38912), 35496 states have internal predecessors, (38912), 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:27:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35497 states to 35497 states and 38912 transitions. [2022-01-10 00:27:47,024 INFO L78 Accepts]: Start accepts. Automaton has 35497 states and 38912 transitions. Word has length 635 [2022-01-10 00:27:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:47,024 INFO L470 AbstractCegarLoop]: Abstraction has 35497 states and 38912 transitions. [2022-01-10 00:27:47,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 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:27:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35497 states and 38912 transitions. [2022-01-10 00:27:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-01-10 00:27:47,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:47,042 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:47,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:27:47,042 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:47,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1650487390, now seen corresponding path program 1 times [2022-01-10 00:27:47,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:47,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923722827] [2022-01-10 00:27:47,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:47,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-01-10 00:27:47,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:47,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923722827] [2022-01-10 00:27:47,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923722827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:47,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:47,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:47,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485327519] [2022-01-10 00:27:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:47,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:47,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:47,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:47,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:47,207 INFO L87 Difference]: Start difference. First operand 35497 states and 38912 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:27:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:48,700 INFO L93 Difference]: Finished difference Result 80344 states and 88597 transitions. [2022-01-10 00:27:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:48,700 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 661 [2022-01-10 00:27:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:48,749 INFO L225 Difference]: With dead ends: 80344 [2022-01-10 00:27:48,750 INFO L226 Difference]: Without dead ends: 45274 [2022-01-10 00:27:48,771 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:27:48,771 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 439 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:48,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 362 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 00:27:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45274 states. [2022-01-10 00:27:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45274 to 42720. [2022-01-10 00:27:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42720 states, 42719 states have (on average 1.0914113158079544) internal successors, (46624), 42719 states have internal predecessors, (46624), 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:27:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42720 states to 42720 states and 46624 transitions. [2022-01-10 00:27:49,305 INFO L78 Accepts]: Start accepts. Automaton has 42720 states and 46624 transitions. Word has length 661 [2022-01-10 00:27:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:49,306 INFO L470 AbstractCegarLoop]: Abstraction has 42720 states and 46624 transitions. [2022-01-10 00:27:49,306 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:27:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42720 states and 46624 transitions. [2022-01-10 00:27:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2022-01-10 00:27:49,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:49,328 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:49,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:27:49,328 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1090791905, now seen corresponding path program 1 times [2022-01-10 00:27:49,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623202650] [2022-01-10 00:27:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:49,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-01-10 00:27:49,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623202650] [2022-01-10 00:27:49,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623202650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:49,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:49,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:27:49,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22746948] [2022-01-10 00:27:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:49,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:27:49,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:27:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:27:49,748 INFO L87 Difference]: Start difference. First operand 42720 states and 46624 transitions. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 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:27:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:52,007 INFO L93 Difference]: Finished difference Result 102929 states and 112737 transitions. [2022-01-10 00:27:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:27:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 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 698 [2022-01-10 00:27:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:52,075 INFO L225 Difference]: With dead ends: 102929 [2022-01-10 00:27:52,075 INFO L226 Difference]: Without dead ends: 60636 [2022-01-10 00:27:52,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:27:52,100 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 825 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:52,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 180 Invalid, 2674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 00:27:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60636 states. [2022-01-10 00:27:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60636 to 56374. [2022-01-10 00:27:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56374 states, 56373 states have (on average 1.100172068188672) internal successors, (62020), 56373 states have internal predecessors, (62020), 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:27:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56374 states to 56374 states and 62020 transitions. [2022-01-10 00:27:52,888 INFO L78 Accepts]: Start accepts. Automaton has 56374 states and 62020 transitions. Word has length 698 [2022-01-10 00:27:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:52,888 INFO L470 AbstractCegarLoop]: Abstraction has 56374 states and 62020 transitions. [2022-01-10 00:27:52,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 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:27:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 56374 states and 62020 transitions. [2022-01-10 00:27:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2022-01-10 00:27:52,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:52,906 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:52,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 00:27:52,907 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1339675404, now seen corresponding path program 1 times [2022-01-10 00:27:52,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:52,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893382074] [2022-01-10 00:27:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:52,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-01-10 00:27:53,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:53,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893382074] [2022-01-10 00:27:53,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893382074] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:53,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:53,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:53,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657191491] [2022-01-10 00:27:53,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:53,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:53,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:53,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:53,051 INFO L87 Difference]: Start difference. First operand 56374 states and 62020 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:27:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:54,874 INFO L93 Difference]: Finished difference Result 124676 states and 137552 transitions. [2022-01-10 00:27:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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 699 [2022-01-10 00:27:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:54,938 INFO L225 Difference]: With dead ends: 124676 [2022-01-10 00:27:54,938 INFO L226 Difference]: Without dead ends: 66171 [2022-01-10 00:27:54,949 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:27:54,950 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 431 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:54,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 594 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 00:27:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66171 states. [2022-01-10 00:27:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66171 to 64461. [2022-01-10 00:27:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64461 states, 64460 states have (on average 1.099922432516289) internal successors, (70901), 64460 states have internal predecessors, (70901), 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:27:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64461 states to 64461 states and 70901 transitions. [2022-01-10 00:27:55,847 INFO L78 Accepts]: Start accepts. Automaton has 64461 states and 70901 transitions. Word has length 699 [2022-01-10 00:27:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:55,848 INFO L470 AbstractCegarLoop]: Abstraction has 64461 states and 70901 transitions. [2022-01-10 00:27:55,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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:27:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 64461 states and 70901 transitions. [2022-01-10 00:27:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2022-01-10 00:27:55,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:55,882 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:55,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 00:27:55,882 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 448649391, now seen corresponding path program 1 times [2022-01-10 00:27:55,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:55,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372182960] [2022-01-10 00:27:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:55,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-01-10 00:27:56,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:56,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372182960] [2022-01-10 00:27:56,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372182960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:56,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:56,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:56,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350791016] [2022-01-10 00:27:56,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:56,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:56,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:56,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:56,152 INFO L87 Difference]: Start difference. First operand 64461 states and 70901 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:27:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:27:58,030 INFO L93 Difference]: Finished difference Result 131048 states and 144049 transitions. [2022-01-10 00:27:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:27:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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 718 [2022-01-10 00:27:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:27:58,116 INFO L225 Difference]: With dead ends: 131048 [2022-01-10 00:27:58,116 INFO L226 Difference]: Without dead ends: 67014 [2022-01-10 00:27:58,159 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:27:58,159 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 114 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 00:27:58,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 781 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 00:27:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67014 states. [2022-01-10 00:27:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67014 to 66586. [2022-01-10 00:27:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66586 states, 66585 states have (on average 1.0968386273184652) internal successors, (73033), 66585 states have internal predecessors, (73033), 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:27:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66586 states to 66586 states and 73033 transitions. [2022-01-10 00:27:59,030 INFO L78 Accepts]: Start accepts. Automaton has 66586 states and 73033 transitions. Word has length 718 [2022-01-10 00:27:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:27:59,031 INFO L470 AbstractCegarLoop]: Abstraction has 66586 states and 73033 transitions. [2022-01-10 00:27:59,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:27:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 66586 states and 73033 transitions. [2022-01-10 00:27:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2022-01-10 00:27:59,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:27:59,055 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 00:27:59,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 00:27:59,056 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:27:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:27:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash 345824951, now seen corresponding path program 1 times [2022-01-10 00:27:59,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:27:59,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094730457] [2022-01-10 00:27:59,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:27:59,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:27:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:27:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-01-10 00:27:59,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:27:59,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094730457] [2022-01-10 00:27:59,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094730457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:27:59,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:27:59,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:27:59,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087662646] [2022-01-10 00:27:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:27:59,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:27:59,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:27:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:27:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:27:59,443 INFO L87 Difference]: Start difference. First operand 66586 states and 73033 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:28:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:28:01,096 INFO L93 Difference]: Finished difference Result 151464 states and 166277 transitions. [2022-01-10 00:28:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:28:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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 722 [2022-01-10 00:28:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:28:01,203 INFO L225 Difference]: With dead ends: 151464 [2022-01-10 00:28:01,203 INFO L226 Difference]: Without dead ends: 85305 [2022-01-10 00:28:01,368 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:28:01,369 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 396 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:28:01,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 264 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 00:28:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85305 states. [2022-01-10 00:28:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85305 to 82324. [2022-01-10 00:28:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82324 states, 82323 states have (on average 1.089731909672874) internal successors, (89710), 82323 states have internal predecessors, (89710), 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:28:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82324 states to 82324 states and 89710 transitions. [2022-01-10 00:28:02,302 INFO L78 Accepts]: Start accepts. Automaton has 82324 states and 89710 transitions. Word has length 722 [2022-01-10 00:28:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:28:02,315 INFO L470 AbstractCegarLoop]: Abstraction has 82324 states and 89710 transitions. [2022-01-10 00:28:02,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:28:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 82324 states and 89710 transitions. [2022-01-10 00:28:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2022-01-10 00:28:02,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:28:02,481 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:02,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 00:28:02,481 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:28:02,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:28:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -152065236, now seen corresponding path program 1 times [2022-01-10 00:28:02,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:28:02,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993479093] [2022-01-10 00:28:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:28:02,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:28:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:28:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-01-10 00:28:02,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:28:02,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993479093] [2022-01-10 00:28:02,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993479093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:28:02,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:28:02,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:28:02,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000998987] [2022-01-10 00:28:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:28:02,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:28:02,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:28:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:28:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:28:02,940 INFO L87 Difference]: Start difference. First operand 82324 states and 89710 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:28:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:28:04,658 INFO L93 Difference]: Finished difference Result 168472 states and 183279 transitions. [2022-01-10 00:28:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:28:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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 752 [2022-01-10 00:28:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:28:04,753 INFO L225 Difference]: With dead ends: 168472 [2022-01-10 00:28:04,753 INFO L226 Difference]: Without dead ends: 86575 [2022-01-10 00:28:04,786 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:28:04,787 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:28:04,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 745 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 00:28:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86575 states. [2022-01-10 00:28:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86575 to 86572. [2022-01-10 00:28:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86572 states, 86571 states have (on average 1.0804426424553257) internal successors, (93535), 86571 states have internal predecessors, (93535), 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:28:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86572 states to 86572 states and 93535 transitions. [2022-01-10 00:28:05,928 INFO L78 Accepts]: Start accepts. Automaton has 86572 states and 93535 transitions. Word has length 752 [2022-01-10 00:28:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:28:05,929 INFO L470 AbstractCegarLoop]: Abstraction has 86572 states and 93535 transitions. [2022-01-10 00:28:05,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:28:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 86572 states and 93535 transitions. [2022-01-10 00:28:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2022-01-10 00:28:06,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:28:06,301 INFO L514 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:06,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 00:28:06,302 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:28:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:28:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1102994304, now seen corresponding path program 1 times [2022-01-10 00:28:06,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:28:06,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29366680] [2022-01-10 00:28:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:28:06,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:28:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:28:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2022-01-10 00:28:06,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:28:06,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29366680] [2022-01-10 00:28:06,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29366680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:28:06,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:28:06,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:28:06,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557053696] [2022-01-10 00:28:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:28:06,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:28:06,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:28:06,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:28:06,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:28:06,617 INFO L87 Difference]: Start difference. First operand 86572 states and 93535 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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:28:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:28:08,529 INFO L93 Difference]: Finished difference Result 173978 states and 187714 transitions. [2022-01-10 00:28:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:28:08,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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 1038 [2022-01-10 00:28:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:28:08,812 INFO L225 Difference]: With dead ends: 173978 [2022-01-10 00:28:08,812 INFO L226 Difference]: Without dead ends: 87832 [2022-01-10 00:28:08,849 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:28:08,851 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 450 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:28:08,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 320 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 00:28:08,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87832 states.