/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 07:32:16,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 07:32:16,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 07:32:16,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 07:32:16,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 07:32:16,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 07:32:16,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 07:32:16,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 07:32:16,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 07:32:16,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 07:32:16,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 07:32:16,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 07:32:16,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 07:32:16,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 07:32:16,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 07:32:16,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 07:32:16,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 07:32:16,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 07:32:16,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 07:32:16,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 07:32:16,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 07:32:16,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 07:32:16,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 07:32:16,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 07:32:16,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 07:32:16,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 07:32:16,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 07:32:16,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 07:32:16,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 07:32:16,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 07:32:16,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 07:32:16,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 07:32:16,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 07:32:16,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 07:32:16,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 07:32:16,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 07:32:16,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 07:32:16,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 07:32:16,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 07:32:16,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 07:32:16,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 07:32:16,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf [2020-04-18 07:32:16,587 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 07:32:16,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 07:32:16,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 07:32:16,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 07:32:16,589 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 07:32:16,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 07:32:16,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 07:32:16,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 07:32:16,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 07:32:16,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 07:32:16,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 07:32:16,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 07:32:16,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 07:32:16,593 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 07:32:16,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 07:32:16,593 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 07:32:16,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 07:32:16,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 07:32:16,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 07:32:16,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 07:32:16,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 07:32:16,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:32:16,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 07:32:16,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 07:32:16,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 07:32:16,595 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 07:32:16,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 07:32:16,596 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 07:32:16,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 07:32:16,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 07:32:16,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 07:32:16,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 07:32:16,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 07:32:16,879 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 07:32:16,879 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 07:32:16,880 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-04-18 07:32:16,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dd484ee/5e38b80239fd43208399e3de97686ab9/FLAG2bd6acc4d [2020-04-18 07:32:17,522 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 07:32:17,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-04-18 07:32:17,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dd484ee/5e38b80239fd43208399e3de97686ab9/FLAG2bd6acc4d [2020-04-18 07:32:17,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8dd484ee/5e38b80239fd43208399e3de97686ab9 [2020-04-18 07:32:17,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 07:32:17,796 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 07:32:17,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 07:32:17,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 07:32:17,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 07:32:17,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:32:17" (1/1) ... [2020-04-18 07:32:17,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489a6ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:17, skipping insertion in model container [2020-04-18 07:32:17,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:32:17" (1/1) ... [2020-04-18 07:32:17,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 07:32:17,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 07:32:18,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:32:18,425 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 07:32:18,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:32:18,679 INFO L208 MainTranslator]: Completed translation [2020-04-18 07:32:18,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18 WrapperNode [2020-04-18 07:32:18,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 07:32:18,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 07:32:18,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 07:32:18,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 07:32:18,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 07:32:18,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 07:32:18,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 07:32:18,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 07:32:18,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... [2020-04-18 07:32:18,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 07:32:18,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 07:32:18,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 07:32:18,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 07:32:18,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:32:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 07:32:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 07:32:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 07:32:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-04-18 07:32:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-04-18 07:32:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-04-18 07:32:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-04-18 07:32:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-04-18 07:32:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-04-18 07:32:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-04-18 07:32:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-04-18 07:32:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 07:32:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-18 07:32:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 07:32:18,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 07:32:18,832 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 07:32:19,257 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 07:32:19,257 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-04-18 07:32:19,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:32:19 BoogieIcfgContainer [2020-04-18 07:32:19,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 07:32:19,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 07:32:19,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 07:32:19,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 07:32:19,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 07:32:17" (1/3) ... [2020-04-18 07:32:19,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c5962d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:32:19, skipping insertion in model container [2020-04-18 07:32:19,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:32:18" (2/3) ... [2020-04-18 07:32:19,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c5962d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:32:19, skipping insertion in model container [2020-04-18 07:32:19,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:32:19" (3/3) ... [2020-04-18 07:32:19,271 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-04-18 07:32:19,282 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 07:32:19,282 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 07:32:19,289 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 07:32:19,290 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 07:32:19,339 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,340 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,340 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,340 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,341 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,341 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,341 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,341 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,342 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,342 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,342 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,342 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,343 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,343 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,343 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,344 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,344 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,344 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,344 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,345 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,346 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,346 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,346 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,347 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,347 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,347 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,347 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,347 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,348 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,348 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,348 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,348 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,349 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,349 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,351 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,351 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,351 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,352 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,353 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,353 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,354 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,354 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,354 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,355 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,355 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,357 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,357 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,357 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,357 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,357 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,358 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,358 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,358 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,358 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,358 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,359 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,360 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,360 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,360 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,360 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,361 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,361 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,361 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,361 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,362 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,362 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,362 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,362 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,363 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,363 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,363 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,363 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,364 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,364 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,364 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,364 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,364 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,365 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,365 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,365 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,365 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,365 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,366 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,366 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,366 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,366 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,367 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,367 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,367 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,367 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,371 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,371 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,371 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,371 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,378 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,379 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,379 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,379 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,383 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,383 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,383 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,384 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,386 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,387 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,387 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,387 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,387 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,387 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,388 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,388 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,388 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,388 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,388 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,389 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,390 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,390 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,391 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,391 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,391 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,391 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,392 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,394 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,395 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,395 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,395 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,395 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,396 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,401 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,401 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,401 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,402 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,407 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,407 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,407 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,407 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,408 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,408 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,410 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,410 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,411 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,414 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,414 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,415 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,415 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,419 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,419 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,419 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,421 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,422 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,422 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:32:19,610 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-18 07:32:19,633 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:32:19,634 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:32:19,634 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:32:19,634 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:32:19,634 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:32:19,634 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:32:19,634 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:32:19,634 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:32:19,666 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-04-18 07:32:19,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-04-18 07:32:19,822 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-04-18 07:32:19,823 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-04-18 07:32:19,837 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-04-18 07:32:19,850 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-04-18 07:32:19,909 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-04-18 07:32:19,909 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-04-18 07:32:19,912 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-04-18 07:32:19,921 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2020-04-18 07:32:19,922 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:32:21,959 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-04-18 07:32:22,075 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-04-18 07:32:22,302 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2020-04-18 07:32:22,302 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-04-18 07:32:22,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-04-18 07:32:22,838 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-04-18 07:32:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-04-18 07:32:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:32:22,849 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:22,850 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:22,850 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-04-18 07:32:22,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:22,868 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [42842830] [2020-04-18 07:32:22,887 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:22,902 INFO L259 McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions. [2020-04-18 07:32:22,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-04-18 07:32:22,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:32:22,904 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 2 times [2020-04-18 07:32:22,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:22,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074817] [2020-04-18 07:32:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:23,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074817] [2020-04-18 07:32:23,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:23,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 07:32:23,192 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:23,193 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:23,197 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 13 transitions. [2020-04-18 07:32:23,197 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:23,232 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:23,238 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 7 states. [2020-04-18 07:32:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:23,346 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 07:32:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 07:32:23,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:23,347 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [42842830] [2020-04-18 07:32:23,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:23,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 07:32:23,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [42842830] [2020-04-18 07:32:23,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 07:32:23,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:23,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-04-18 07:32:23,359 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 7 states. [2020-04-18 07:32:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:23,708 INFO L93 Difference]: Finished difference Result 4746 states and 19878 transitions. [2020-04-18 07:32:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 07:32:23,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-04-18 07:32:23,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:23,774 INFO L225 Difference]: With dead ends: 4746 [2020-04-18 07:32:23,774 INFO L226 Difference]: Without dead ends: 4260 [2020-04-18 07:32:23,776 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-04-18 07:32:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2020-04-18 07:32:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3008. [2020-04-18 07:32:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-04-18 07:32:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-04-18 07:32:24,066 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-04-18 07:32:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:24,067 INFO L479 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-04-18 07:32:24,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 07:32:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-04-18 07:32:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 07:32:24,068 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:24,069 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:24,069 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-04-18 07:32:24,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:24,070 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1756747748] [2020-04-18 07:32:24,071 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,072 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-04-18 07:32:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-04-18 07:32:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 07:32:24,074 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,074 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 2 times [2020-04-18 07:32:24,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:24,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433483053] [2020-04-18 07:32:24,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:24,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433483053] [2020-04-18 07:32:24,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:24,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:32:24,143 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:24,145 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,149 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 07:32:24,149 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:24,153 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:24,153 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-04-18 07:32:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:24,162 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-04-18 07:32:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-04-18 07:32:24,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:24,163 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1756747748] [2020-04-18 07:32:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:32:24,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1756747748] [2020-04-18 07:32:24,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:32:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:24,166 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-04-18 07:32:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:24,262 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-04-18 07:32:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:32:24,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-04-18 07:32:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:24,292 INFO L225 Difference]: With dead ends: 4848 [2020-04-18 07:32:24,292 INFO L226 Difference]: Without dead ends: 3558 [2020-04-18 07:32:24,294 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-04-18 07:32:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-04-18 07:32:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-04-18 07:32:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-04-18 07:32:24,433 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-04-18 07:32:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:24,433 INFO L479 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-04-18 07:32:24,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:32:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-04-18 07:32:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:32:24,435 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:24,435 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:24,435 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:24,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-04-18 07:32:24,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:24,436 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1832850309] [2020-04-18 07:32:24,437 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,438 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2020-04-18 07:32:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-04-18 07:32:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:32:24,439 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 69436495, now seen corresponding path program 2 times [2020-04-18 07:32:24,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:24,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734865618] [2020-04-18 07:32:24,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:24,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734865618] [2020-04-18 07:32:24,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:24,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:24,501 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:24,503 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,506 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-04-18 07:32:24,507 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:24,519 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:24,520 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-04-18 07:32:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:24,533 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2020-04-18 07:32:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2020-04-18 07:32:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:32:24,534 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 3 times [2020-04-18 07:32:24,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:24,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015747351] [2020-04-18 07:32:24,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:24,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015747351] [2020-04-18 07:32:24,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:24,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:24,616 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:24,618 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,621 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 36 transitions. [2020-04-18 07:32:24,621 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:24,666 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:24,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:24,667 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 7 states. [2020-04-18 07:32:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:24,782 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2020-04-18 07:32:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2020-04-18 07:32:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:32:24,783 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:24,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash 595444189, now seen corresponding path program 4 times [2020-04-18 07:32:24,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:24,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752456294] [2020-04-18 07:32:24,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:24,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752456294] [2020-04-18 07:32:24,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:24,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 07:32:24,885 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:24,953 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:24,956 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 27 transitions. [2020-04-18 07:32:24,956 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:25,031 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:32:25,032 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 7 states. [2020-04-18 07:32:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:25,119 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2020-04-18 07:32:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2020-04-18 07:32:25,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:25,121 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1832850309] [2020-04-18 07:32:25,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:25,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 07:32:25,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1832850309] [2020-04-18 07:32:25,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 07:32:25,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:32:25,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-04-18 07:32:25,123 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 12 states. [2020-04-18 07:32:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:25,783 INFO L93 Difference]: Finished difference Result 4851 states and 18552 transitions. [2020-04-18 07:32:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 07:32:25,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-04-18 07:32:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:25,860 INFO L225 Difference]: With dead ends: 4851 [2020-04-18 07:32:25,860 INFO L226 Difference]: Without dead ends: 4827 [2020-04-18 07:32:25,862 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-04-18 07:32:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2020-04-18 07:32:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3573. [2020-04-18 07:32:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-04-18 07:32:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-04-18 07:32:26,050 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-04-18 07:32:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:26,050 INFO L479 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-04-18 07:32:26,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 07:32:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-04-18 07:32:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:32:26,053 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:26,053 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:26,053 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-04-18 07:32:26,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:26,055 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1801360075] [2020-04-18 07:32:26,056 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:26,057 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2020-04-18 07:32:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-04-18 07:32:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:32:26,058 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:26,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:26,059 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 2 times [2020-04-18 07:32:26,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:26,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330460140] [2020-04-18 07:32:26,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:26,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330460140] [2020-04-18 07:32:26,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:26,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:26,168 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:26,170 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:26,174 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-04-18 07:32:26,175 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:26,208 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:26,209 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 7 states. [2020-04-18 07:32:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:26,318 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-04-18 07:32:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-04-18 07:32:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:32:26,319 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1561087029, now seen corresponding path program 3 times [2020-04-18 07:32:26,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:26,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81519895] [2020-04-18 07:32:26,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:26,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81519895] [2020-04-18 07:32:26,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:26,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:32:26,524 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:26,526 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:26,530 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 22 transitions. [2020-04-18 07:32:26,530 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:26,632 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:26,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:32:26,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:32:26,633 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 8 states. [2020-04-18 07:32:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:26,974 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2020-04-18 07:32:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2020-04-18 07:32:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:32:26,975 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 4 times [2020-04-18 07:32:26,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:26,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136522823] [2020-04-18 07:32:26,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:27,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136522823] [2020-04-18 07:32:27,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:27,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:32:27,099 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:27,101 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:27,104 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 07:32:27,104 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:27,210 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2020-04-18 07:32:27,211 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 10 states. [2020-04-18 07:32:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:27,487 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2020-04-18 07:32:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2020-04-18 07:32:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:32:27,487 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 5 times [2020-04-18 07:32:27,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:27,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350425035] [2020-04-18 07:32:27,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:27,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350425035] [2020-04-18 07:32:27,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:27,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:32:27,740 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:27,742 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:27,745 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 20 transitions. [2020-04-18 07:32:27,745 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:28,060 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:28,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:32:28,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 07:32:28,061 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 11 states. [2020-04-18 07:32:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:28,574 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-04-18 07:32:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-04-18 07:32:28,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:28,575 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1801360075] [2020-04-18 07:32:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 07:32:28,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1801360075] [2020-04-18 07:32:28,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-04-18 07:32:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-04-18 07:32:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 07:32:28,577 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 23 states. [2020-04-18 07:32:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:29,948 INFO L93 Difference]: Finished difference Result 5615 states and 22431 transitions. [2020-04-18 07:32:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 07:32:29,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2020-04-18 07:32:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:29,976 INFO L225 Difference]: With dead ends: 5615 [2020-04-18 07:32:29,976 INFO L226 Difference]: Without dead ends: 5463 [2020-04-18 07:32:29,977 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=480, Invalid=1970, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 07:32:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2020-04-18 07:32:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 4116. [2020-04-18 07:32:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-04-18 07:32:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-04-18 07:32:30,140 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-04-18 07:32:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:30,140 INFO L479 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-04-18 07:32:30,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-04-18 07:32:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-04-18 07:32:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:30,142 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:30,142 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:30,143 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:30,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:30,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-04-18 07:32:30,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:30,143 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2046033128] [2020-04-18 07:32:30,144 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:30,146 INFO L259 McrAutomatonBuilder]: Finished intersection with 56 states and 98 transitions. [2020-04-18 07:32:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-04-18 07:32:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:30,147 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1990996254, now seen corresponding path program 2 times [2020-04-18 07:32:30,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:30,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391861714] [2020-04-18 07:32:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:30,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391861714] [2020-04-18 07:32:30,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:30,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:30,175 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:30,176 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:30,180 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 34 transitions. [2020-04-18 07:32:30,180 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:30,186 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:30,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:30,187 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2020-04-18 07:32:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:30,207 INFO L93 Difference]: Finished difference Result 71 states and 120 transitions. [2020-04-18 07:32:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 120 transitions. [2020-04-18 07:32:30,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:30,208 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1992351264, now seen corresponding path program 3 times [2020-04-18 07:32:30,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:30,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390222423] [2020-04-18 07:32:30,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:30,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390222423] [2020-04-18 07:32:30,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:30,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:30,280 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:30,281 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:30,285 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 44 transitions. [2020-04-18 07:32:30,285 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:30,322 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:30,322 INFO L87 Difference]: Start difference. First operand 71 states and 120 transitions. Second operand 7 states. [2020-04-18 07:32:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:30,446 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2020-04-18 07:32:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2020-04-18 07:32:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:30,447 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2041802788, now seen corresponding path program 4 times [2020-04-18 07:32:30,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:30,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851752610] [2020-04-18 07:32:30,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:30,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851752610] [2020-04-18 07:32:30,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:30,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:30,511 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:30,513 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:30,516 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2020-04-18 07:32:30,516 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:30,573 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:30,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:32:30,574 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand 7 states. [2020-04-18 07:32:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:30,657 INFO L93 Difference]: Finished difference Result 110 states and 176 transitions. [2020-04-18 07:32:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2020-04-18 07:32:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:30,658 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 5 times [2020-04-18 07:32:30,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:30,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379298354] [2020-04-18 07:32:30,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:30,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379298354] [2020-04-18 07:32:30,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:30,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:30,738 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:30,739 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:30,742 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-04-18 07:32:30,742 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:30,855 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:32:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:32:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2020-04-18 07:32:30,857 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand 9 states. [2020-04-18 07:32:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:30,988 INFO L93 Difference]: Finished difference Result 110 states and 176 transitions. [2020-04-18 07:32:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2020-04-18 07:32:30,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:30,989 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2046033128] [2020-04-18 07:32:30,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:30,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-04-18 07:32:30,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2046033128] [2020-04-18 07:32:30,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 07:32:30,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 07:32:30,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2020-04-18 07:32:30,991 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 17 states. [2020-04-18 07:32:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:31,681 INFO L93 Difference]: Finished difference Result 5239 states and 20352 transitions. [2020-04-18 07:32:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 07:32:31,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2020-04-18 07:32:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:31,704 INFO L225 Difference]: With dead ends: 5239 [2020-04-18 07:32:31,704 INFO L226 Difference]: Without dead ends: 5239 [2020-04-18 07:32:31,705 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2020-04-18 07:32:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2020-04-18 07:32:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 4078. [2020-04-18 07:32:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-04-18 07:32:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-04-18 07:32:31,858 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-04-18 07:32:31,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:31,859 INFO L479 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-04-18 07:32:31,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 07:32:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-04-18 07:32:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:31,861 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:31,861 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:31,861 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:31,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:31,861 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 1 times [2020-04-18 07:32:31,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:31,862 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [820187715] [2020-04-18 07:32:31,863 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:31,864 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2020-04-18 07:32:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 07:32:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:31,865 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash 496766702, now seen corresponding path program 2 times [2020-04-18 07:32:31,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:31,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409187403] [2020-04-18 07:32:31,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:31,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409187403] [2020-04-18 07:32:31,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:31,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:31,935 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:31,937 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:31,940 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2020-04-18 07:32:31,940 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:31,968 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:31,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:31,969 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 7 states. [2020-04-18 07:32:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:32,085 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2020-04-18 07:32:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-04-18 07:32:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:32,086 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 102521118, now seen corresponding path program 3 times [2020-04-18 07:32:32,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:32,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563384153] [2020-04-18 07:32:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:32,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563384153] [2020-04-18 07:32:32,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:32,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:32:32,199 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:32,201 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:32,204 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 07:32:32,204 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:32,280 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-04-18 07:32:32,280 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 10 states. [2020-04-18 07:32:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:32,553 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2020-04-18 07:32:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2020-04-18 07:32:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:32,554 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 4 times [2020-04-18 07:32:32,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:32,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253236201] [2020-04-18 07:32:32,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:32,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253236201] [2020-04-18 07:32:32,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:32,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:32:32,876 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:32,881 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:32,884 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 23 transitions. [2020-04-18 07:32:32,884 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:33,099 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:32:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2020-04-18 07:32:33,100 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand 11 states. [2020-04-18 07:32:33,413 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2020-04-18 07:32:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:33,520 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-04-18 07:32:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2020-04-18 07:32:33,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:33,521 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [820187715] [2020-04-18 07:32:33,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:33,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 07:32:33,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [820187715] [2020-04-18 07:32:33,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 07:32:33,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:33,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 07:32:33,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2020-04-18 07:32:33,524 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 19 states. [2020-04-18 07:32:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:34,332 INFO L93 Difference]: Finished difference Result 5191 states and 21231 transitions. [2020-04-18 07:32:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 07:32:34,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2020-04-18 07:32:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:34,350 INFO L225 Difference]: With dead ends: 5191 [2020-04-18 07:32:34,350 INFO L226 Difference]: Without dead ends: 5117 [2020-04-18 07:32:34,351 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 07:32:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2020-04-18 07:32:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 3978. [2020-04-18 07:32:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-04-18 07:32:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-04-18 07:32:34,482 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 19 [2020-04-18 07:32:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:34,484 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-04-18 07:32:34,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 07:32:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-04-18 07:32:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:34,486 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:34,486 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:34,486 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:34,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-04-18 07:32:34,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:34,487 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [566463365] [2020-04-18 07:32:34,488 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:34,490 INFO L259 McrAutomatonBuilder]: Finished intersection with 65 states and 117 transitions. [2020-04-18 07:32:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-04-18 07:32:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:34,491 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1591346490, now seen corresponding path program 2 times [2020-04-18 07:32:34,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:34,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921426597] [2020-04-18 07:32:34,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:34,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921426597] [2020-04-18 07:32:34,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:34,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:34,515 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:34,516 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:34,520 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-04-18 07:32:34,520 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:34,527 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:34,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:34,528 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-04-18 07:32:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:34,542 INFO L93 Difference]: Finished difference Result 85 states and 148 transitions. [2020-04-18 07:32:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 148 transitions. [2020-04-18 07:32:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:34,542 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1633351800, now seen corresponding path program 3 times [2020-04-18 07:32:34,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:34,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783466948] [2020-04-18 07:32:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:34,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783466948] [2020-04-18 07:32:34,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:34,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:34,602 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:34,605 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:34,609 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-04-18 07:32:34,610 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:34,646 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:34,647 INFO L87 Difference]: Start difference. First operand 85 states and 148 transitions. Second operand 7 states. [2020-04-18 07:32:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:34,773 INFO L93 Difference]: Finished difference Result 132 states and 222 transitions. [2020-04-18 07:32:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 222 transitions. [2020-04-18 07:32:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:34,773 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:34,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1128627772, now seen corresponding path program 4 times [2020-04-18 07:32:34,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:34,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260279524] [2020-04-18 07:32:34,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:34,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260279524] [2020-04-18 07:32:34,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:34,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:34,822 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:34,824 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:34,828 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 07:32:34,828 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:34,888 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:34,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:32:34,888 INFO L87 Difference]: Start difference. First operand 132 states and 222 transitions. Second operand 7 states. [2020-04-18 07:32:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:34,974 INFO L93 Difference]: Finished difference Result 134 states and 222 transitions. [2020-04-18 07:32:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 222 transitions. [2020-04-18 07:32:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:34,975 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 5 times [2020-04-18 07:32:34,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:34,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060456422] [2020-04-18 07:32:34,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:35,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060456422] [2020-04-18 07:32:35,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:35,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:32:35,115 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:35,117 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:35,121 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 07:32:35,121 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:35,280 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-04-18 07:32:35,280 INFO L87 Difference]: Start difference. First operand 134 states and 222 transitions. Second operand 10 states. [2020-04-18 07:32:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:35,650 INFO L93 Difference]: Finished difference Result 181 states and 295 transitions. [2020-04-18 07:32:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2020-04-18 07:32:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:35,651 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:32:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 6 times [2020-04-18 07:32:35,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:35,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730356957] [2020-04-18 07:32:35,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:35,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730356957] [2020-04-18 07:32:35,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:35,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:32:35,854 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:35,855 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:35,859 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 07:32:35,859 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:36,145 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:36,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 07:32:36,146 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand 10 states. [2020-04-18 07:32:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:36,746 INFO L93 Difference]: Finished difference Result 222 states and 357 transitions. [2020-04-18 07:32:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2020-04-18 07:32:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:32:36,747 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:32:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 7 times [2020-04-18 07:32:36,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:36,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230407937] [2020-04-18 07:32:36,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:36,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230407937] [2020-04-18 07:32:36,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:36,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:32:36,834 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:36,836 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:36,840 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 42 transitions. [2020-04-18 07:32:36,841 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:36,932 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:32:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 07:32:36,933 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand 9 states. [2020-04-18 07:32:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:37,242 INFO L93 Difference]: Finished difference Result 247 states and 391 transitions. [2020-04-18 07:32:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 391 transitions. [2020-04-18 07:32:37,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:37,243 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [566463365] [2020-04-18 07:32:37,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:37,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 07:32:37,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [566463365] [2020-04-18 07:32:37,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-04-18 07:32:37,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-04-18 07:32:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 07:32:37,246 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 27 states. [2020-04-18 07:32:38,263 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-04-18 07:32:38,701 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-04-18 07:32:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:40,013 INFO L93 Difference]: Finished difference Result 6696 states and 26086 transitions. [2020-04-18 07:32:40,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-18 07:32:40,013 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 20 [2020-04-18 07:32:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:40,034 INFO L225 Difference]: With dead ends: 6696 [2020-04-18 07:32:40,035 INFO L226 Difference]: Without dead ends: 6604 [2020-04-18 07:32:40,036 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=818, Invalid=3604, Unknown=0, NotChecked=0, Total=4422 [2020-04-18 07:32:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2020-04-18 07:32:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 3948. [2020-04-18 07:32:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-04-18 07:32:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-04-18 07:32:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-04-18 07:32:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:40,187 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-04-18 07:32:40,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-04-18 07:32:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-04-18 07:32:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:40,189 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:40,189 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:40,190 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-04-18 07:32:40,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:40,190 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1922035777] [2020-04-18 07:32:40,191 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:40,193 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 72 transitions. [2020-04-18 07:32:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-04-18 07:32:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:40,193 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1964861934, now seen corresponding path program 2 times [2020-04-18 07:32:40,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:40,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224196341] [2020-04-18 07:32:40,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:40,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224196341] [2020-04-18 07:32:40,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:40,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:32:40,217 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:40,219 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:40,222 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 07:32:40,223 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:40,227 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:40,228 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-04-18 07:32:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:40,245 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2020-04-18 07:32:40,245 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2020-04-18 07:32:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:40,246 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 3 times [2020-04-18 07:32:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:40,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483700519] [2020-04-18 07:32:40,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:40,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483700519] [2020-04-18 07:32:40,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:40,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:40,300 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:40,302 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:40,306 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2020-04-18 07:32:40,307 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:40,338 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:40,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:40,339 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand 7 states. [2020-04-18 07:32:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:40,461 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2020-04-18 07:32:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2020-04-18 07:32:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:40,461 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 536754116, now seen corresponding path program 4 times [2020-04-18 07:32:40,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:40,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890471195] [2020-04-18 07:32:40,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:40,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890471195] [2020-04-18 07:32:40,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:40,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 07:32:40,518 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:40,520 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:40,524 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 29 transitions. [2020-04-18 07:32:40,524 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:40,578 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:32:40,579 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand 7 states. [2020-04-18 07:32:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:40,660 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2020-04-18 07:32:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2020-04-18 07:32:40,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:40,661 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1922035777] [2020-04-18 07:32:40,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:40,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 07:32:40,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1922035777] [2020-04-18 07:32:40,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 07:32:40,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:32:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-04-18 07:32:40,662 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 12 states. [2020-04-18 07:32:41,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:41,235 INFO L93 Difference]: Finished difference Result 5703 states and 21873 transitions. [2020-04-18 07:32:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 07:32:41,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-04-18 07:32:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:41,251 INFO L225 Difference]: With dead ends: 5703 [2020-04-18 07:32:41,251 INFO L226 Difference]: Without dead ends: 5056 [2020-04-18 07:32:41,252 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2020-04-18 07:32:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2020-04-18 07:32:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 3901. [2020-04-18 07:32:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-04-18 07:32:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 15421 transitions. [2020-04-18 07:32:41,363 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 15421 transitions. Word has length 21 [2020-04-18 07:32:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:41,363 INFO L479 AbstractCegarLoop]: Abstraction has 3901 states and 15421 transitions. [2020-04-18 07:32:41,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 07:32:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 15421 transitions. [2020-04-18 07:32:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:41,366 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:41,367 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:41,367 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1183087759, now seen corresponding path program 1 times [2020-04-18 07:32:41,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:41,368 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1900550878] [2020-04-18 07:32:41,368 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:41,370 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2020-04-18 07:32:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 07:32:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:41,371 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2086944531, now seen corresponding path program 2 times [2020-04-18 07:32:41,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:41,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843325463] [2020-04-18 07:32:41,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:41,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843325463] [2020-04-18 07:32:41,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:41,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:41,391 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:41,393 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:41,398 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 36 transitions. [2020-04-18 07:32:41,398 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:41,402 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:41,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:41,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:41,402 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 07:32:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:41,418 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2020-04-18 07:32:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2020-04-18 07:32:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:41,418 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:41,419 INFO L82 PathProgramCache]: Analyzing trace with hash 905858155, now seen corresponding path program 3 times [2020-04-18 07:32:41,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:41,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322471191] [2020-04-18 07:32:41,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:41,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322471191] [2020-04-18 07:32:41,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:41,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:41,471 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:41,473 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:41,477 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 46 transitions. [2020-04-18 07:32:41,478 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:41,514 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:41,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:41,515 INFO L87 Difference]: Start difference. First operand 99 states and 176 transitions. Second operand 7 states. [2020-04-18 07:32:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:41,629 INFO L93 Difference]: Finished difference Result 156 states and 268 transitions. [2020-04-18 07:32:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 268 transitions. [2020-04-18 07:32:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:41,630 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:41,630 INFO L82 PathProgramCache]: Analyzing trace with hash -828967921, now seen corresponding path program 4 times [2020-04-18 07:32:41,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:41,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693775572] [2020-04-18 07:32:41,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:41,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693775572] [2020-04-18 07:32:41,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:41,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:41,677 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:41,679 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:41,683 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2020-04-18 07:32:41,683 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:41,723 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:32:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 07:32:41,724 INFO L87 Difference]: Start difference. First operand 156 states and 268 transitions. Second operand 6 states. [2020-04-18 07:32:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:41,786 INFO L93 Difference]: Finished difference Result 162 states and 272 transitions. [2020-04-18 07:32:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 272 transitions. [2020-04-18 07:32:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:41,787 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash -999269101, now seen corresponding path program 5 times [2020-04-18 07:32:41,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:41,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864913705] [2020-04-18 07:32:41,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:41,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864913705] [2020-04-18 07:32:41,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:41,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:32:41,896 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:41,898 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:41,903 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 07:32:41,903 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:42,087 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:32:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2020-04-18 07:32:42,088 INFO L87 Difference]: Start difference. First operand 162 states and 272 transitions. Second operand 10 states. [2020-04-18 07:32:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:42,267 INFO L93 Difference]: Finished difference Result 162 states and 272 transitions. [2020-04-18 07:32:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 272 transitions. [2020-04-18 07:32:42,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:42,268 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1900550878] [2020-04-18 07:32:42,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:42,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 07:32:42,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1900550878] [2020-04-18 07:32:42,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-18 07:32:42,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:42,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 07:32:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2020-04-18 07:32:42,270 INFO L87 Difference]: Start difference. First operand 3901 states and 15421 transitions. Second operand 18 states. [2020-04-18 07:32:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:43,007 INFO L93 Difference]: Finished difference Result 4517 states and 17318 transitions. [2020-04-18 07:32:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 07:32:43,008 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2020-04-18 07:32:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:43,018 INFO L225 Difference]: With dead ends: 4517 [2020-04-18 07:32:43,018 INFO L226 Difference]: Without dead ends: 4362 [2020-04-18 07:32:43,018 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 07:32:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2020-04-18 07:32:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3680. [2020-04-18 07:32:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2020-04-18 07:32:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2020-04-18 07:32:43,112 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2020-04-18 07:32:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:43,113 INFO L479 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2020-04-18 07:32:43,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-18 07:32:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2020-04-18 07:32:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:43,116 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:43,117 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:43,117 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:43,117 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 1 times [2020-04-18 07:32:43,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:43,117 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [271555936] [2020-04-18 07:32:43,118 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:43,120 INFO L259 McrAutomatonBuilder]: Finished intersection with 92 states and 192 transitions. [2020-04-18 07:32:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-04-18 07:32:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:43,121 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2086945207, now seen corresponding path program 2 times [2020-04-18 07:32:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:43,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511175504] [2020-04-18 07:32:43,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:43,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511175504] [2020-04-18 07:32:43,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:43,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:43,144 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:43,146 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:43,150 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 07:32:43,150 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:43,154 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:43,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:43,155 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-04-18 07:32:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:43,170 INFO L93 Difference]: Finished difference Result 127 states and 260 transitions. [2020-04-18 07:32:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 260 transitions. [2020-04-18 07:32:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:43,171 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 905857479, now seen corresponding path program 3 times [2020-04-18 07:32:43,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:43,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459147931] [2020-04-18 07:32:43,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:43,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459147931] [2020-04-18 07:32:43,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:43,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:43,220 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:43,222 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:43,227 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2020-04-18 07:32:43,228 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:43,269 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:43,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:43,270 INFO L87 Difference]: Start difference. First operand 127 states and 260 transitions. Second operand 7 states. [2020-04-18 07:32:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:43,405 INFO L93 Difference]: Finished difference Result 204 states and 408 transitions. [2020-04-18 07:32:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 408 transitions. [2020-04-18 07:32:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:43,406 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -828968597, now seen corresponding path program 4 times [2020-04-18 07:32:43,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:43,407 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910584882] [2020-04-18 07:32:43,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:43,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910584882] [2020-04-18 07:32:43,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:43,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:43,466 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:43,468 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:43,473 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 07:32:43,473 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:43,519 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:32:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 07:32:43,520 INFO L87 Difference]: Start difference. First operand 204 states and 408 transitions. Second operand 6 states. [2020-04-18 07:32:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:43,657 INFO L93 Difference]: Finished difference Result 212 states and 414 transitions. [2020-04-18 07:32:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 414 transitions. [2020-04-18 07:32:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:43,658 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -999290057, now seen corresponding path program 5 times [2020-04-18 07:32:43,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:43,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096474630] [2020-04-18 07:32:43,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:43,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096474630] [2020-04-18 07:32:43,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:43,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:32:43,870 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:43,872 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:43,877 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-04-18 07:32:43,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:44,120 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2020-04-18 07:32:44,121 INFO L87 Difference]: Start difference. First operand 212 states and 414 transitions. Second operand 10 states. [2020-04-18 07:32:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:44,868 INFO L93 Difference]: Finished difference Result 286 states and 553 transitions. [2020-04-18 07:32:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 553 transitions. [2020-04-18 07:32:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:44,869 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:32:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:44,870 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 6 times [2020-04-18 07:32:44,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:44,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161429662] [2020-04-18 07:32:44,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:45,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161429662] [2020-04-18 07:32:45,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:45,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:32:45,189 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:45,190 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:45,194 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 25 transitions. [2020-04-18 07:32:45,194 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:45,622 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:45,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:32:45,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 07:32:45,623 INFO L87 Difference]: Start difference. First operand 286 states and 553 transitions. Second operand 12 states. [2020-04-18 07:32:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:46,399 INFO L93 Difference]: Finished difference Result 366 states and 703 transitions. [2020-04-18 07:32:46,399 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 703 transitions. [2020-04-18 07:32:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:46,400 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:32:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1086742877, now seen corresponding path program 7 times [2020-04-18 07:32:46,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:46,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190273186] [2020-04-18 07:32:46,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:46,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190273186] [2020-04-18 07:32:46,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:46,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:32:46,477 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:46,479 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:46,483 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-04-18 07:32:46,483 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:46,579 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:32:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 07:32:46,581 INFO L87 Difference]: Start difference. First operand 366 states and 703 transitions. Second operand 9 states. [2020-04-18 07:32:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:46,904 INFO L93 Difference]: Finished difference Result 424 states and 799 transitions. [2020-04-18 07:32:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 799 transitions. [2020-04-18 07:32:46,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:46,906 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [271555936] [2020-04-18 07:32:46,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:46,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 07:32:46,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [271555936] [2020-04-18 07:32:46,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 07:32:46,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:46,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 07:32:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2020-04-18 07:32:46,908 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 29 states. [2020-04-18 07:32:47,674 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2020-04-18 07:32:47,837 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2020-04-18 07:32:48,033 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2020-04-18 07:32:48,210 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2020-04-18 07:32:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:49,269 INFO L93 Difference]: Finished difference Result 5059 states and 19398 transitions. [2020-04-18 07:32:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 07:32:49,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2020-04-18 07:32:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:49,280 INFO L225 Difference]: With dead ends: 5059 [2020-04-18 07:32:49,281 INFO L226 Difference]: Without dead ends: 5010 [2020-04-18 07:32:49,282 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=651, Invalid=3131, Unknown=0, NotChecked=0, Total=3782 [2020-04-18 07:32:49,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2020-04-18 07:32:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 3330. [2020-04-18 07:32:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2020-04-18 07:32:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2020-04-18 07:32:49,375 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2020-04-18 07:32:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:49,375 INFO L479 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2020-04-18 07:32:49,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 07:32:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2020-04-18 07:32:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:49,378 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:49,378 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:49,378 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:49,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 1 times [2020-04-18 07:32:49,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:49,379 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1139682021] [2020-04-18 07:32:49,380 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:49,382 INFO L259 McrAutomatonBuilder]: Finished intersection with 60 states and 104 transitions. [2020-04-18 07:32:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-04-18 07:32:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:49,383 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1705083825, now seen corresponding path program 2 times [2020-04-18 07:32:49,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:49,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521030149] [2020-04-18 07:32:49,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:49,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521030149] [2020-04-18 07:32:49,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:49,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:49,435 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:49,437 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:49,442 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 50 transitions. [2020-04-18 07:32:49,442 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:49,471 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:49,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:49,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:49,472 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 7 states. [2020-04-18 07:32:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:49,581 INFO L93 Difference]: Finished difference Result 87 states and 145 transitions. [2020-04-18 07:32:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 145 transitions. [2020-04-18 07:32:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:49,581 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1676999295, now seen corresponding path program 3 times [2020-04-18 07:32:49,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:49,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3789116] [2020-04-18 07:32:49,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:49,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3789116] [2020-04-18 07:32:49,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:49,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:32:49,706 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:49,708 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:49,713 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 07:32:49,713 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:49,775 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:32:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-04-18 07:32:49,776 INFO L87 Difference]: Start difference. First operand 87 states and 145 transitions. Second operand 10 states. [2020-04-18 07:32:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:50,083 INFO L93 Difference]: Finished difference Result 109 states and 179 transitions. [2020-04-18 07:32:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 179 transitions. [2020-04-18 07:32:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:50,084 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:50,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 4 times [2020-04-18 07:32:50,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:50,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959196843] [2020-04-18 07:32:50,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:50,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959196843] [2020-04-18 07:32:50,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:50,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:32:50,382 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:50,385 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:50,391 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 29 transitions. [2020-04-18 07:32:50,392 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:50,816 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:50,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:32:50,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2020-04-18 07:32:50,817 INFO L87 Difference]: Start difference. First operand 109 states and 179 transitions. Second operand 12 states. [2020-04-18 07:32:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:51,516 INFO L93 Difference]: Finished difference Result 115 states and 184 transitions. [2020-04-18 07:32:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2020-04-18 07:32:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:32:51,517 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2100148047, now seen corresponding path program 5 times [2020-04-18 07:32:51,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:51,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540928110] [2020-04-18 07:32:51,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:51,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540928110] [2020-04-18 07:32:51,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:51,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:32:51,794 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:51,796 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:51,800 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-04-18 07:32:51,800 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:52,205 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:32:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:32:52,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 07:32:52,206 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand 12 states. [2020-04-18 07:32:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:52,978 INFO L93 Difference]: Finished difference Result 139 states and 222 transitions. [2020-04-18 07:32:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 222 transitions. [2020-04-18 07:32:52,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:52,979 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1139682021] [2020-04-18 07:32:52,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:52,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-04-18 07:32:52,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1139682021] [2020-04-18 07:32:52,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 07:32:52,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 07:32:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2020-04-18 07:32:52,982 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 29 states. [2020-04-18 07:32:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:54,715 INFO L93 Difference]: Finished difference Result 3499 states and 13062 transitions. [2020-04-18 07:32:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 07:32:54,716 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2020-04-18 07:32:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:54,723 INFO L225 Difference]: With dead ends: 3499 [2020-04-18 07:32:54,723 INFO L226 Difference]: Without dead ends: 3343 [2020-04-18 07:32:54,724 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=635, Invalid=3025, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 07:32:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2020-04-18 07:32:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2831. [2020-04-18 07:32:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-04-18 07:32:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-04-18 07:32:54,790 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-04-18 07:32:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:54,790 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-04-18 07:32:54,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 07:32:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-04-18 07:32:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:54,794 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:54,794 INFO L425 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] [2020-04-18 07:32:54,794 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-04-18 07:32:54,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:54,795 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1074588676] [2020-04-18 07:32:54,796 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:54,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 111 transitions. [2020-04-18 07:32:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-04-18 07:32:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:54,798 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1118891378, now seen corresponding path program 2 times [2020-04-18 07:32:54,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:54,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875136863] [2020-04-18 07:32:54,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:54,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875136863] [2020-04-18 07:32:54,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:54,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:32:54,821 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:54,823 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:54,828 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 47 transitions. [2020-04-18 07:32:54,828 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:54,832 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:54,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:54,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:54,833 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2020-04-18 07:32:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:54,845 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2020-04-18 07:32:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 115 transitions. [2020-04-18 07:32:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:54,845 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1120678838, now seen corresponding path program 3 times [2020-04-18 07:32:54,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:54,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547486297] [2020-04-18 07:32:54,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:54,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547486297] [2020-04-18 07:32:54,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:54,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:32:54,897 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:54,900 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:54,904 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-04-18 07:32:54,905 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:54,937 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:32:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:54,938 INFO L87 Difference]: Start difference. First operand 68 states and 115 transitions. Second operand 7 states. [2020-04-18 07:32:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:55,061 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-04-18 07:32:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2020-04-18 07:32:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:55,062 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:32:55,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 4 times [2020-04-18 07:32:55,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:55,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119252029] [2020-04-18 07:32:55,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:55,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119252029] [2020-04-18 07:32:55,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:55,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:32:55,171 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:55,174 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:55,180 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-04-18 07:32:55,180 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:55,327 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:32:55,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-04-18 07:32:55,327 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand 8 states. [2020-04-18 07:32:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:55,641 INFO L93 Difference]: Finished difference Result 128 states and 199 transitions. [2020-04-18 07:32:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-04-18 07:32:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:55,642 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:32:55,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 5 times [2020-04-18 07:32:55,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:55,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810602957] [2020-04-18 07:32:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:55,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810602957] [2020-04-18 07:32:55,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:55,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:32:55,767 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:55,769 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:55,775 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 07:32:55,775 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:55,932 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:32:55,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2020-04-18 07:32:55,933 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 9 states. [2020-04-18 07:32:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:56,400 INFO L93 Difference]: Finished difference Result 154 states and 235 transitions. [2020-04-18 07:32:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2020-04-18 07:32:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:56,401 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:32:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 6 times [2020-04-18 07:32:56,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:56,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497244980] [2020-04-18 07:32:56,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:56,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497244980] [2020-04-18 07:32:56,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:56,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:32:56,527 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:56,529 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:56,535 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 52 transitions. [2020-04-18 07:32:56,535 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:56,710 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:32:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:32:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 07:32:56,711 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand 11 states. [2020-04-18 07:32:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:57,174 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2020-04-18 07:32:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2020-04-18 07:32:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 07:32:57,175 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:32:57,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:57,175 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 7 times [2020-04-18 07:32:57,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:57,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492274272] [2020-04-18 07:32:57,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:57,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492274272] [2020-04-18 07:32:57,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:57,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:32:57,472 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:57,474 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:57,479 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 07:32:57,479 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:57,796 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:32:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:32:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2531, Unknown=0, NotChecked=0, Total=2970 [2020-04-18 07:32:57,798 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 11 states. [2020-04-18 07:32:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:58,128 INFO L93 Difference]: Finished difference Result 201 states and 293 transitions. [2020-04-18 07:32:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 293 transitions. [2020-04-18 07:32:58,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:58,129 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1074588676] [2020-04-18 07:32:58,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:58,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 07:32:58,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1074588676] [2020-04-18 07:32:58,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-04-18 07:32:58,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-04-18 07:32:58,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2881, Unknown=0, NotChecked=0, Total=3422 [2020-04-18 07:32:58,132 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 32 states. [2020-04-18 07:32:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:59,804 INFO L93 Difference]: Finished difference Result 3992 states and 14506 transitions. [2020-04-18 07:32:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 07:32:59,805 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 22 [2020-04-18 07:32:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:59,814 INFO L225 Difference]: With dead ends: 3992 [2020-04-18 07:32:59,814 INFO L226 Difference]: Without dead ends: 3932 [2020-04-18 07:32:59,815 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=964, Invalid=3866, Unknown=0, NotChecked=0, Total=4830 [2020-04-18 07:32:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2020-04-18 07:32:59,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 2568. [2020-04-18 07:32:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-04-18 07:32:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 9467 transitions. [2020-04-18 07:32:59,877 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 9467 transitions. Word has length 22 [2020-04-18 07:32:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:59,877 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 9467 transitions. [2020-04-18 07:32:59,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-04-18 07:32:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 9467 transitions. [2020-04-18 07:32:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:32:59,880 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:59,880 INFO L425 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] [2020-04-18 07:32:59,880 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:32:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:59,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 1 times [2020-04-18 07:32:59,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:59,881 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1495080148] [2020-04-18 07:32:59,882 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:59,886 INFO L259 McrAutomatonBuilder]: Finished intersection with 146 states and 342 transitions. [2020-04-18 07:32:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2020-04-18 07:32:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:32:59,888 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash 195891558, now seen corresponding path program 2 times [2020-04-18 07:32:59,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:59,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757670221] [2020-04-18 07:32:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:59,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757670221] [2020-04-18 07:32:59,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:59,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:59,912 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:59,915 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:59,922 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 07:32:59,923 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:59,927 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:59,927 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2020-04-18 07:32:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:59,956 INFO L93 Difference]: Finished difference Result 211 states and 484 transitions. [2020-04-18 07:32:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 484 transitions. [2020-04-18 07:32:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:32:59,958 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:59,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1348815516, now seen corresponding path program 3 times [2020-04-18 07:32:59,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:59,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071480603] [2020-04-18 07:32:59,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:00,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071480603] [2020-04-18 07:33:00,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:00,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:00,067 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:00,071 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:00,083 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 07:33:00,084 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:00,132 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:33:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:00,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:33:00,133 INFO L87 Difference]: Start difference. First operand 211 states and 484 transitions. Second operand 7 states. [2020-04-18 07:33:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:00,295 INFO L93 Difference]: Finished difference Result 348 states and 780 transitions. [2020-04-18 07:33:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 780 transitions. [2020-04-18 07:33:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:00,296 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:33:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2069363704, now seen corresponding path program 4 times [2020-04-18 07:33:00,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:00,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386516280] [2020-04-18 07:33:00,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:00,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386516280] [2020-04-18 07:33:00,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:00,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:00,360 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:00,364 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:00,372 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 47 transitions. [2020-04-18 07:33:00,372 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:00,440 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:33:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:33:00,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 07:33:00,443 INFO L87 Difference]: Start difference. First operand 348 states and 780 transitions. Second operand 6 states. [2020-04-18 07:33:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:00,518 INFO L93 Difference]: Finished difference Result 368 states and 806 transitions. [2020-04-18 07:33:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 806 transitions. [2020-04-18 07:33:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:00,519 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:33:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1770244730, now seen corresponding path program 5 times [2020-04-18 07:33:00,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:00,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316129121] [2020-04-18 07:33:00,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:00,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316129121] [2020-04-18 07:33:00,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:00,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:33:00,726 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:00,729 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:00,737 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2020-04-18 07:33:00,737 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:00,981 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:33:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:33:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2020-04-18 07:33:00,982 INFO L87 Difference]: Start difference. First operand 368 states and 806 transitions. Second operand 10 states. [2020-04-18 07:33:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:01,762 INFO L93 Difference]: Finished difference Result 514 states and 1114 transitions. [2020-04-18 07:33:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1114 transitions. [2020-04-18 07:33:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:01,763 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:33:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 6 times [2020-04-18 07:33:01,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:01,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741740287] [2020-04-18 07:33:01,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:02,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741740287] [2020-04-18 07:33:02,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:02,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:33:02,092 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:02,094 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:02,098 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 31 transitions. [2020-04-18 07:33:02,098 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:02,527 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:33:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:33:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 07:33:02,528 INFO L87 Difference]: Start difference. First operand 514 states and 1114 transitions. Second operand 12 states. [2020-04-18 07:33:02,843 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-04-18 07:33:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:03,470 INFO L93 Difference]: Finished difference Result 604 states and 1306 transitions. [2020-04-18 07:33:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1306 transitions. [2020-04-18 07:33:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:03,472 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:33:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -667536666, now seen corresponding path program 7 times [2020-04-18 07:33:03,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:03,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344134997] [2020-04-18 07:33:03,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:03,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344134997] [2020-04-18 07:33:03,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:03,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:33:03,541 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:03,543 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:03,552 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 81 transitions. [2020-04-18 07:33:03,552 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:03,643 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:33:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:33:03,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2020-04-18 07:33:03,643 INFO L87 Difference]: Start difference. First operand 604 states and 1306 transitions. Second operand 9 states. [2020-04-18 07:33:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:03,965 INFO L93 Difference]: Finished difference Result 748 states and 1610 transitions. [2020-04-18 07:33:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1610 transitions. [2020-04-18 07:33:03,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:03,966 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1495080148] [2020-04-18 07:33:03,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:03,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 07:33:03,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1495080148] [2020-04-18 07:33:03,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-04-18 07:33:03,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-04-18 07:33:03,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2080, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 07:33:03,968 INFO L87 Difference]: Start difference. First operand 2568 states and 9467 transitions. Second operand 28 states. [2020-04-18 07:33:04,830 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-04-18 07:33:05,002 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2020-04-18 07:33:05,197 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-04-18 07:33:05,392 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2020-04-18 07:33:05,823 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-18 07:33:05,983 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-04-18 07:33:06,173 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-04-18 07:33:06,352 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2020-04-18 07:33:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:07,242 INFO L93 Difference]: Finished difference Result 3726 states and 13236 transitions. [2020-04-18 07:33:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 07:33:07,243 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2020-04-18 07:33:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:07,250 INFO L225 Difference]: With dead ends: 3726 [2020-04-18 07:33:07,250 INFO L226 Difference]: Without dead ends: 3630 [2020-04-18 07:33:07,251 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=833, Invalid=3589, Unknown=0, NotChecked=0, Total=4422 [2020-04-18 07:33:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2020-04-18 07:33:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 2150. [2020-04-18 07:33:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-04-18 07:33:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 7745 transitions. [2020-04-18 07:33:07,301 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 7745 transitions. Word has length 23 [2020-04-18 07:33:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:07,302 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 7745 transitions. [2020-04-18 07:33:07,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-04-18 07:33:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 7745 transitions. [2020-04-18 07:33:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:07,305 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:07,305 INFO L425 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] [2020-04-18 07:33:07,305 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:07,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-04-18 07:33:07,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:07,306 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1887869898] [2020-04-18 07:33:07,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:07,310 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 186 transitions. [2020-04-18 07:33:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 07:33:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:07,311 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash -354823029, now seen corresponding path program 2 times [2020-04-18 07:33:07,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:07,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031274004] [2020-04-18 07:33:07,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:07,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031274004] [2020-04-18 07:33:07,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:07,342 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:07,345 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:07,352 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-04-18 07:33:07,353 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:07,356 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:07,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:07,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:07,357 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 07:33:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:07,372 INFO L93 Difference]: Finished difference Result 110 states and 217 transitions. [2020-04-18 07:33:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 217 transitions. [2020-04-18 07:33:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:07,373 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:07,374 INFO L82 PathProgramCache]: Analyzing trace with hash -325895379, now seen corresponding path program 3 times [2020-04-18 07:33:07,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:07,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66978963] [2020-04-18 07:33:07,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:07,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66978963] [2020-04-18 07:33:07,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:07,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:07,463 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:07,466 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:07,480 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-04-18 07:33:07,480 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:07,513 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:33:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:33:07,515 INFO L87 Difference]: Start difference. First operand 110 states and 217 transitions. Second operand 7 states. [2020-04-18 07:33:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:07,678 INFO L93 Difference]: Finished difference Result 171 states and 326 transitions. [2020-04-18 07:33:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 326 transitions. [2020-04-18 07:33:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:07,679 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:33:07,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1434260131, now seen corresponding path program 4 times [2020-04-18 07:33:07,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:07,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125219897] [2020-04-18 07:33:07,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:07,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125219897] [2020-04-18 07:33:07,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:07,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 07:33:07,745 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:07,757 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:07,775 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2020-04-18 07:33:07,775 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:07,863 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:33:07,864 INFO L87 Difference]: Start difference. First operand 171 states and 326 transitions. Second operand 7 states. [2020-04-18 07:33:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:07,988 INFO L93 Difference]: Finished difference Result 180 states and 333 transitions. [2020-04-18 07:33:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 333 transitions. [2020-04-18 07:33:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:07,989 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:33:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1804883745, now seen corresponding path program 5 times [2020-04-18 07:33:07,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:07,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808080682] [2020-04-18 07:33:07,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:08,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808080682] [2020-04-18 07:33:08,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:08,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:33:08,155 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:08,157 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:08,163 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-04-18 07:33:08,163 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:08,347 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:33:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:33:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2020-04-18 07:33:08,348 INFO L87 Difference]: Start difference. First operand 180 states and 333 transitions. Second operand 9 states. [2020-04-18 07:33:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:08,806 INFO L93 Difference]: Finished difference Result 243 states and 443 transitions. [2020-04-18 07:33:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 443 transitions. [2020-04-18 07:33:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:08,807 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:33:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:08,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 6 times [2020-04-18 07:33:08,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:08,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145576117] [2020-04-18 07:33:08,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:09,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145576117] [2020-04-18 07:33:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:33:09,036 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:09,038 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:09,043 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2020-04-18 07:33:09,043 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:09,339 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 07:33:09,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:33:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 07:33:09,340 INFO L87 Difference]: Start difference. First operand 243 states and 443 transitions. Second operand 11 states. [2020-04-18 07:33:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:09,921 INFO L93 Difference]: Finished difference Result 265 states and 473 transitions. [2020-04-18 07:33:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 473 transitions. [2020-04-18 07:33:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:09,922 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:33:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:09,922 INFO L82 PathProgramCache]: Analyzing trace with hash -840432879, now seen corresponding path program 7 times [2020-04-18 07:33:09,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:09,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860630598] [2020-04-18 07:33:09,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:10,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860630598] [2020-04-18 07:33:10,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:10,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 07:33:10,255 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:10,256 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:10,261 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 07:33:10,261 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:10,692 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 07:33:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 07:33:10,693 INFO L87 Difference]: Start difference. First operand 265 states and 473 transitions. Second operand 13 states. [2020-04-18 07:33:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:11,664 INFO L93 Difference]: Finished difference Result 337 states and 600 transitions. [2020-04-18 07:33:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 600 transitions. [2020-04-18 07:33:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:33:11,665 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 07:33:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 567732367, now seen corresponding path program 8 times [2020-04-18 07:33:11,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:11,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369779720] [2020-04-18 07:33:11,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:11,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369779720] [2020-04-18 07:33:11,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:11,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:33:11,794 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:11,796 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:11,803 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 60 transitions. [2020-04-18 07:33:11,803 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:12,048 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 07:33:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 07:33:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3188, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 07:33:12,050 INFO L87 Difference]: Start difference. First operand 337 states and 600 transitions. Second operand 11 states. [2020-04-18 07:33:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:12,598 INFO L93 Difference]: Finished difference Result 403 states and 700 transitions. [2020-04-18 07:33:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 700 transitions. [2020-04-18 07:33:12,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:12,599 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1887869898] [2020-04-18 07:33:12,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:12,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-04-18 07:33:12,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1887869898] [2020-04-18 07:33:12,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-04-18 07:33:12,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-04-18 07:33:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3599, Unknown=0, NotChecked=0, Total=4160 [2020-04-18 07:33:12,601 INFO L87 Difference]: Start difference. First operand 2150 states and 7745 transitions. Second operand 37 states. [2020-04-18 07:33:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:15,564 INFO L93 Difference]: Finished difference Result 3619 states and 12553 transitions. [2020-04-18 07:33:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 07:33:15,564 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 23 [2020-04-18 07:33:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:15,571 INFO L225 Difference]: With dead ends: 3619 [2020-04-18 07:33:15,571 INFO L226 Difference]: Without dead ends: 3445 [2020-04-18 07:33:15,572 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1134, Invalid=6348, Unknown=0, NotChecked=0, Total=7482 [2020-04-18 07:33:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2020-04-18 07:33:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 1824. [2020-04-18 07:33:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2020-04-18 07:33:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 6456 transitions. [2020-04-18 07:33:15,619 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 6456 transitions. Word has length 23 [2020-04-18 07:33:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:15,620 INFO L479 AbstractCegarLoop]: Abstraction has 1824 states and 6456 transitions. [2020-04-18 07:33:15,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-04-18 07:33:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 6456 transitions. [2020-04-18 07:33:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:15,623 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:15,623 INFO L425 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] [2020-04-18 07:33:15,623 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-04-18 07:33:15,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:15,624 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1520409310] [2020-04-18 07:33:15,625 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:15,629 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 137 transitions. [2020-04-18 07:33:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-04-18 07:33:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:15,630 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 942904643, now seen corresponding path program 2 times [2020-04-18 07:33:15,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:15,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914970799] [2020-04-18 07:33:15,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:15,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914970799] [2020-04-18 07:33:15,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:15,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:15,650 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:15,653 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:15,659 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 45 transitions. [2020-04-18 07:33:15,659 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:15,663 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:15,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:15,664 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2020-04-18 07:33:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:15,685 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-04-18 07:33:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 141 transitions. [2020-04-18 07:33:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:15,685 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 3 times [2020-04-18 07:33:15,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:15,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031321770] [2020-04-18 07:33:15,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:15,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031321770] [2020-04-18 07:33:15,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:15,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:15,743 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:15,745 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:15,751 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 59 transitions. [2020-04-18 07:33:15,751 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:15,789 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:33:15,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:15,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:33:15,790 INFO L87 Difference]: Start difference. First operand 80 states and 141 transitions. Second operand 7 states. [2020-04-18 07:33:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:15,915 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2020-04-18 07:33:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 194 transitions. [2020-04-18 07:33:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:15,915 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:33:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -432979543, now seen corresponding path program 4 times [2020-04-18 07:33:15,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:15,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389531012] [2020-04-18 07:33:15,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:16,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389531012] [2020-04-18 07:33:16,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:16,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 07:33:16,006 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:16,008 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:16,012 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 48 transitions. [2020-04-18 07:33:16,013 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:16,104 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:33:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-04-18 07:33:16,104 INFO L87 Difference]: Start difference. First operand 117 states and 194 transitions. Second operand 8 states. [2020-04-18 07:33:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:16,428 INFO L93 Difference]: Finished difference Result 152 states and 245 transitions. [2020-04-18 07:33:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2020-04-18 07:33:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:16,428 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:33:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 5 times [2020-04-18 07:33:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:16,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734331523] [2020-04-18 07:33:16,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:16,571 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734331523] [2020-04-18 07:33:16,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:16,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:33:16,571 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:16,574 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:16,580 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 50 transitions. [2020-04-18 07:33:16,580 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:16,792 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:16,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:33:16,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2020-04-18 07:33:16,793 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 9 states. [2020-04-18 07:33:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:17,354 INFO L93 Difference]: Finished difference Result 184 states and 291 transitions. [2020-04-18 07:33:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 291 transitions. [2020-04-18 07:33:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:17,355 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:33:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 6 times [2020-04-18 07:33:17,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:17,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548898532] [2020-04-18 07:33:17,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:17,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548898532] [2020-04-18 07:33:17,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:33:17,569 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:17,571 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:17,577 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 07:33:17,577 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:17,769 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 07:33:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:33:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 07:33:17,769 INFO L87 Difference]: Start difference. First operand 184 states and 291 transitions. Second operand 12 states. [2020-04-18 07:33:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:18,302 INFO L93 Difference]: Finished difference Result 205 states and 316 transitions. [2020-04-18 07:33:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2020-04-18 07:33:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:33:18,302 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:33:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 7 times [2020-04-18 07:33:18,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:18,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816323597] [2020-04-18 07:33:18,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:18,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816323597] [2020-04-18 07:33:18,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:18,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 07:33:18,611 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:18,614 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:18,620 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 38 transitions. [2020-04-18 07:33:18,620 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:19,028 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:19,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 07:33:19,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2649, Unknown=0, NotChecked=0, Total=3080 [2020-04-18 07:33:19,029 INFO L87 Difference]: Start difference. First operand 205 states and 316 transitions. Second operand 13 states. [2020-04-18 07:33:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:19,871 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2020-04-18 07:33:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2020-04-18 07:33:19,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:19,873 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1520409310] [2020-04-18 07:33:19,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:19,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-04-18 07:33:19,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1520409310] [2020-04-18 07:33:19,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-04-18 07:33:19,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-04-18 07:33:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=3326, Unknown=0, NotChecked=0, Total=3906 [2020-04-18 07:33:19,875 INFO L87 Difference]: Start difference. First operand 1824 states and 6456 transitions. Second operand 33 states. [2020-04-18 07:33:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:22,153 INFO L93 Difference]: Finished difference Result 3130 states and 10239 transitions. [2020-04-18 07:33:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-18 07:33:22,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 24 [2020-04-18 07:33:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:22,160 INFO L225 Difference]: With dead ends: 3130 [2020-04-18 07:33:22,160 INFO L226 Difference]: Without dead ends: 2938 [2020-04-18 07:33:22,161 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=966, Invalid=5514, Unknown=0, NotChecked=0, Total=6480 [2020-04-18 07:33:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-04-18 07:33:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2015. [2020-04-18 07:33:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2020-04-18 07:33:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 7088 transitions. [2020-04-18 07:33:22,203 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 7088 transitions. Word has length 24 [2020-04-18 07:33:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:22,204 INFO L479 AbstractCegarLoop]: Abstraction has 2015 states and 7088 transitions. [2020-04-18 07:33:22,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-04-18 07:33:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 7088 transitions. [2020-04-18 07:33:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:22,207 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:22,207 INFO L425 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] [2020-04-18 07:33:22,207 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-04-18 07:33:22,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:22,208 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [518874896] [2020-04-18 07:33:22,209 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:22,215 INFO L259 McrAutomatonBuilder]: Finished intersection with 230 states and 636 transitions. [2020-04-18 07:33:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-04-18 07:33:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:22,217 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -165212943, now seen corresponding path program 2 times [2020-04-18 07:33:22,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:22,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406855730] [2020-04-18 07:33:22,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:22,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406855730] [2020-04-18 07:33:22,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:22,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:22,276 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:22,278 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:22,284 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 52 transitions. [2020-04-18 07:33:22,284 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:22,288 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:22,289 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 3 states. [2020-04-18 07:33:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:22,307 INFO L93 Difference]: Finished difference Result 332 states and 865 transitions. [2020-04-18 07:33:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 865 transitions. [2020-04-18 07:33:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:22,307 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash -136285293, now seen corresponding path program 3 times [2020-04-18 07:33:22,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:22,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232095572] [2020-04-18 07:33:22,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:22,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:22,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232095572] [2020-04-18 07:33:22,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:22,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:22,386 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:22,388 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:22,393 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 54 transitions. [2020-04-18 07:33:22,394 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:22,426 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:33:22,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:22,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:33:22,426 INFO L87 Difference]: Start difference. First operand 332 states and 865 transitions. Second operand 7 states. [2020-04-18 07:33:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:22,563 INFO L93 Difference]: Finished difference Result 536 states and 1350 transitions. [2020-04-18 07:33:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1350 transitions. [2020-04-18 07:33:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:22,565 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:33:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2022445897, now seen corresponding path program 4 times [2020-04-18 07:33:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:22,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269238078] [2020-04-18 07:33:22,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:22,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269238078] [2020-04-18 07:33:22,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:22,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 07:33:22,612 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:22,614 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:22,619 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 45 transitions. [2020-04-18 07:33:22,619 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:22,669 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 07:33:22,670 INFO L87 Difference]: Start difference. First operand 536 states and 1350 transitions. Second operand 7 states. [2020-04-18 07:33:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:22,778 INFO L93 Difference]: Finished difference Result 585 states and 1425 transitions. [2020-04-18 07:33:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1425 transitions. [2020-04-18 07:33:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:22,779 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:33:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1216697979, now seen corresponding path program 5 times [2020-04-18 07:33:22,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:22,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594408645] [2020-04-18 07:33:22,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:22,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594408645] [2020-04-18 07:33:22,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:22,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:33:22,961 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:22,963 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:22,968 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 54 transitions. [2020-04-18 07:33:22,969 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:23,172 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:33:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:33:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2020-04-18 07:33:23,173 INFO L87 Difference]: Start difference. First operand 585 states and 1425 transitions. Second operand 10 states. [2020-04-18 07:33:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:24,150 INFO L93 Difference]: Finished difference Result 800 states and 1916 transitions. [2020-04-18 07:33:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1916 transitions. [2020-04-18 07:33:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:24,151 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 07:33:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 6 times [2020-04-18 07:33:24,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:24,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704046995] [2020-04-18 07:33:24,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:24,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704046995] [2020-04-18 07:33:24,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:24,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:33:24,460 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:24,461 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:24,468 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 57 transitions. [2020-04-18 07:33:24,468 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:24,875 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 07:33:24,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:33:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 07:33:24,876 INFO L87 Difference]: Start difference. First operand 800 states and 1916 transitions. Second operand 12 states. [2020-04-18 07:33:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:25,683 INFO L93 Difference]: Finished difference Result 918 states and 2147 transitions. [2020-04-18 07:33:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2147 transitions. [2020-04-18 07:33:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 07:33:25,685 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 07:33:25,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:25,686 INFO L82 PathProgramCache]: Analyzing trace with hash -229229463, now seen corresponding path program 7 times [2020-04-18 07:33:25,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:25,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549530194] [2020-04-18 07:33:25,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:25,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549530194] [2020-04-18 07:33:25,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:25,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 07:33:25,879 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:25,881 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:25,889 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2020-04-18 07:33:25,890 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:26,264 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 07:33:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 07:33:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2020-04-18 07:33:26,265 INFO L87 Difference]: Start difference. First operand 918 states and 2147 transitions. Second operand 12 states. [2020-04-18 07:33:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:26,941 INFO L93 Difference]: Finished difference Result 918 states and 2147 transitions. [2020-04-18 07:33:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2147 transitions. [2020-04-18 07:33:26,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:26,943 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [518874896] [2020-04-18 07:33:26,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:26,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 07:33:26,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [518874896] [2020-04-18 07:33:26,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-04-18 07:33:26,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-04-18 07:33:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=3543, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 07:33:26,944 INFO L87 Difference]: Start difference. First operand 2015 states and 7088 transitions. Second operand 35 states. [2020-04-18 07:33:28,731 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-04-18 07:33:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:29,833 INFO L93 Difference]: Finished difference Result 2587 states and 8796 transitions. [2020-04-18 07:33:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 07:33:29,833 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 25 [2020-04-18 07:33:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:29,840 INFO L225 Difference]: With dead ends: 2587 [2020-04-18 07:33:29,840 INFO L226 Difference]: Without dead ends: 2564 [2020-04-18 07:33:29,840 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1240, Invalid=5900, Unknown=0, NotChecked=0, Total=7140 [2020-04-18 07:33:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-04-18 07:33:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1627. [2020-04-18 07:33:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2020-04-18 07:33:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 5611 transitions. [2020-04-18 07:33:29,865 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 5611 transitions. Word has length 25 [2020-04-18 07:33:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:29,866 INFO L479 AbstractCegarLoop]: Abstraction has 1627 states and 5611 transitions. [2020-04-18 07:33:29,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-04-18 07:33:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 5611 transitions. [2020-04-18 07:33:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:33:29,868 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:29,868 INFO L425 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] [2020-04-18 07:33:29,868 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 1 times [2020-04-18 07:33:29,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:29,869 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1138966383] [2020-04-18 07:33:29,869 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:29,874 INFO L259 McrAutomatonBuilder]: Finished intersection with 185 states and 459 transitions. [2020-04-18 07:33:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2020-04-18 07:33:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:33:29,875 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1769117283, now seen corresponding path program 2 times [2020-04-18 07:33:29,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:29,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081809995] [2020-04-18 07:33:29,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:29,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081809995] [2020-04-18 07:33:29,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:29,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:29,889 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:29,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:29,896 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 47 transitions. [2020-04-18 07:33:29,896 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:29,898 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:29,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:29,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:29,899 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 3 states. [2020-04-18 07:33:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:29,921 INFO L93 Difference]: Finished difference Result 239 states and 562 transitions. [2020-04-18 07:33:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 562 transitions. [2020-04-18 07:33:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:33:29,921 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash 273935123, now seen corresponding path program 3 times [2020-04-18 07:33:29,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:29,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195394444] [2020-04-18 07:33:29,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:29,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195394444] [2020-04-18 07:33:29,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:29,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 07:33:29,994 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:29,998 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:30,008 INFO L259 McrAutomatonBuilder]: Finished intersection with 44 states and 61 transitions. [2020-04-18 07:33:30,008 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:30,044 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:33:30,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:33:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:33:30,045 INFO L87 Difference]: Start difference. First operand 239 states and 562 transitions. Second operand 7 states. [2020-04-18 07:33:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:30,179 INFO L93 Difference]: Finished difference Result 368 states and 822 transitions. [2020-04-18 07:33:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 822 transitions. [2020-04-18 07:33:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:33:30,180 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 07:33:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 4 times [2020-04-18 07:33:30,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:30,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980330095] [2020-04-18 07:33:30,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:30,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980330095] [2020-04-18 07:33:30,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:30,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 07:33:30,351 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:30,352 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:30,358 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 07:33:30,358 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:30,540 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:33:30,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 07:33:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-04-18 07:33:30,540 INFO L87 Difference]: Start difference. First operand 368 states and 822 transitions. Second operand 10 states. [2020-04-18 07:33:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:31,494 INFO L93 Difference]: Finished difference Result 488 states and 1061 transitions. [2020-04-18 07:33:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1061 transitions. [2020-04-18 07:33:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:33:31,495 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 07:33:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 5 times [2020-04-18 07:33:31,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:31,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053668056] [2020-04-18 07:33:31,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:31,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053668056] [2020-04-18 07:33:31,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:31,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 07:33:31,706 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:31,708 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:31,715 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 60 transitions. [2020-04-18 07:33:31,716 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:32,010 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 07:33:32,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 07:33:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 07:33:32,011 INFO L87 Difference]: Start difference. First operand 488 states and 1061 transitions. Second operand 13 states. [2020-04-18 07:33:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:32,628 INFO L93 Difference]: Finished difference Result 488 states and 1061 transitions. [2020-04-18 07:33:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1061 transitions. [2020-04-18 07:33:32,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:32,629 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1138966383] [2020-04-18 07:33:32,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:32,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-04-18 07:33:32,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1138966383] [2020-04-18 07:33:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-04-18 07:33:32,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-04-18 07:33:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1622, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 07:33:32,631 INFO L87 Difference]: Start difference. First operand 1627 states and 5611 transitions. Second operand 25 states. [2020-04-18 07:33:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:33,712 INFO L93 Difference]: Finished difference Result 1491 states and 5003 transitions. [2020-04-18 07:33:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 07:33:33,713 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2020-04-18 07:33:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:33,716 INFO L225 Difference]: With dead ends: 1491 [2020-04-18 07:33:33,716 INFO L226 Difference]: Without dead ends: 1447 [2020-04-18 07:33:33,717 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=729, Invalid=2463, Unknown=0, NotChecked=0, Total=3192 [2020-04-18 07:33:33,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-04-18 07:33:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 885. [2020-04-18 07:33:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-04-18 07:33:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-04-18 07:33:33,736 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-04-18 07:33:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:33,736 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-04-18 07:33:33,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-04-18 07:33:33,736 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-04-18 07:33:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:33,738 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:33,738 INFO L425 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] [2020-04-18 07:33:33,738 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:33,738 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-04-18 07:33:33,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:33,738 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [417683165] [2020-04-18 07:33:33,740 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:33,769 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 07:33:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 07:33:33,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:33,776 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:33,776 INFO L82 PathProgramCache]: Analyzing trace with hash 415588464, now seen corresponding path program 2 times [2020-04-18 07:33:33,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:33,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467326589] [2020-04-18 07:33:33,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:33,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467326589] [2020-04-18 07:33:33,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:33,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:33,810 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:33,817 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:33,842 INFO L259 McrAutomatonBuilder]: Finished intersection with 76 states and 114 transitions. [2020-04-18 07:33:33,842 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:33,846 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:33,846 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 07:33:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:33,873 INFO L93 Difference]: Finished difference Result 1132 states and 3708 transitions. [2020-04-18 07:33:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3708 transitions. [2020-04-18 07:33:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:33,874 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 3 times [2020-04-18 07:33:33,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:33,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103083660] [2020-04-18 07:33:33,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:33,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103083660] [2020-04-18 07:33:33,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:33,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:33:33,956 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:33,961 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:33,997 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 189 transitions. [2020-04-18 07:33:33,997 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:34,035 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:33:34,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:33:34,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-04-18 07:33:34,035 INFO L87 Difference]: Start difference. First operand 1132 states and 3708 transitions. Second operand 8 states. [2020-04-18 07:33:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:34,182 INFO L93 Difference]: Finished difference Result 1132 states and 3708 transitions. [2020-04-18 07:33:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3708 transitions. [2020-04-18 07:33:34,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:34,185 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [417683165] [2020-04-18 07:33:34,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:34,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 07:33:34,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [417683165] [2020-04-18 07:33:34,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-04-18 07:33:34,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:33:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-04-18 07:33:34,186 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 9 states. [2020-04-18 07:33:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:34,438 INFO L93 Difference]: Finished difference Result 991 states and 3416 transitions. [2020-04-18 07:33:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 07:33:34,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-04-18 07:33:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:34,441 INFO L225 Difference]: With dead ends: 991 [2020-04-18 07:33:34,442 INFO L226 Difference]: Without dead ends: 985 [2020-04-18 07:33:34,442 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-04-18 07:33:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2020-04-18 07:33:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 879. [2020-04-18 07:33:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-04-18 07:33:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-04-18 07:33:34,454 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-04-18 07:33:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:34,454 INFO L479 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-04-18 07:33:34,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-04-18 07:33:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-04-18 07:33:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:34,456 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:34,456 INFO L425 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] [2020-04-18 07:33:34,456 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-04-18 07:33:34,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:34,457 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1276448363] [2020-04-18 07:33:34,458 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:34,487 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 07:33:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 07:33:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:34,492 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash -535568566, now seen corresponding path program 2 times [2020-04-18 07:33:34,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:34,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910548286] [2020-04-18 07:33:34,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:34,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910548286] [2020-04-18 07:33:34,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:34,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:34,524 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:34,531 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:34,559 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 108 transitions. [2020-04-18 07:33:34,559 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:34,572 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:34,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:34,572 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 07:33:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:34,604 INFO L93 Difference]: Finished difference Result 1120 states and 3678 transitions. [2020-04-18 07:33:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3678 transitions. [2020-04-18 07:33:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:34,606 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 3 times [2020-04-18 07:33:34,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:34,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548591706] [2020-04-18 07:33:34,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:34,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548591706] [2020-04-18 07:33:34,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:34,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 07:33:34,683 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:34,690 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:34,728 INFO L259 McrAutomatonBuilder]: Finished intersection with 106 states and 197 transitions. [2020-04-18 07:33:34,729 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:34,774 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:33:34,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:33:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-04-18 07:33:34,774 INFO L87 Difference]: Start difference. First operand 1120 states and 3678 transitions. Second operand 8 states. [2020-04-18 07:33:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:34,985 INFO L93 Difference]: Finished difference Result 1120 states and 3678 transitions. [2020-04-18 07:33:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3678 transitions. [2020-04-18 07:33:34,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:33:34,988 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1276448363] [2020-04-18 07:33:34,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:33:34,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 07:33:34,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1276448363] [2020-04-18 07:33:34,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-04-18 07:33:34,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:33:34,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 07:33:34,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-04-18 07:33:34,991 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 9 states. [2020-04-18 07:33:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:35,301 INFO L93 Difference]: Finished difference Result 985 states and 3393 transitions. [2020-04-18 07:33:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 07:33:35,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-04-18 07:33:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:33:35,304 INFO L225 Difference]: With dead ends: 985 [2020-04-18 07:33:35,304 INFO L226 Difference]: Without dead ends: 925 [2020-04-18 07:33:35,305 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-04-18 07:33:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2020-04-18 07:33:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 819. [2020-04-18 07:33:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-04-18 07:33:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-04-18 07:33:35,327 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-04-18 07:33:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:33:35,327 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-04-18 07:33:35,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-04-18 07:33:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-04-18 07:33:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:35,330 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:33:35,330 INFO L425 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] [2020-04-18 07:33:35,332 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 07:33:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-04-18 07:33:35,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:33:35,333 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1463458645] [2020-04-18 07:33:35,336 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:35,429 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 07:33:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 07:33:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:35,439 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:33:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1950385618, now seen corresponding path program 2 times [2020-04-18 07:33:35,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:35,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063878008] [2020-04-18 07:33:35,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:33:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:33:35,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063878008] [2020-04-18 07:33:35,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:33:35,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:33:35,484 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:33:35,497 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:33:35,536 INFO L259 McrAutomatonBuilder]: Finished intersection with 79 states and 123 transitions. [2020-04-18 07:33:35,537 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:33:35,545 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:33:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:33:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:33:35,546 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 07:33:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:33:35,594 INFO L93 Difference]: Finished difference Result 1168 states and 3822 transitions. [2020-04-18 07:33:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3822 transitions. [2020-04-18 07:33:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:33:35,597 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:33:35,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:33:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 3 times [2020-04-18 07:33:35,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:33:35,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013261208] [2020-04-18 07:33:35,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:33:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:33:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:33:35,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:33:35,730 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:33:35,730 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:33:35,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 07:33:35 BasicIcfg [2020-04-18 07:33:35,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 07:33:35,879 INFO L168 Benchmark]: Toolchain (without parser) took 78103.50 ms. Allocated memory was 137.4 MB in the beginning and 1.0 GB in the end (delta: 895.5 MB). Free memory was 100.3 MB in the beginning and 127.7 MB in the end (delta: -27.4 MB). Peak memory consumption was 868.1 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,881 INFO L168 Benchmark]: CDTParser took 1.31 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.84 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 98.4 MB in the beginning and 121.4 MB in the end (delta: -23.0 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.51 ms. Allocated memory is still 202.4 MB. Free memory was 121.4 MB in the beginning and 119.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,882 INFO L168 Benchmark]: Boogie Preprocessor took 27.37 ms. Allocated memory is still 202.4 MB. Free memory was 119.2 MB in the beginning and 117.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,882 INFO L168 Benchmark]: RCFGBuilder took 500.39 ms. Allocated memory is still 202.4 MB. Free memory was 117.0 MB in the beginning and 90.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,882 INFO L168 Benchmark]: TraceAbstraction took 76613.33 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 830.5 MB). Free memory was 90.0 MB in the beginning and 127.7 MB in the end (delta: -37.6 MB). Peak memory consumption was 792.8 MB. Max. memory is 7.1 GB. [2020-04-18 07:33:35,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.31 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.84 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 98.4 MB in the beginning and 121.4 MB in the end (delta: -23.0 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.51 ms. Allocated memory is still 202.4 MB. Free memory was 121.4 MB in the beginning and 119.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.37 ms. Allocated memory is still 202.4 MB. Free memory was 119.2 MB in the beginning and 117.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.39 ms. Allocated memory is still 202.4 MB. Free memory was 117.0 MB in the beginning and 90.8 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76613.33 ms. Allocated memory was 202.4 MB in the beginning and 1.0 GB in the end (delta: 830.5 MB). Free memory was 90.0 MB in the beginning and 127.7 MB in the end (delta: -37.6 MB). Peak memory consumption was 792.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 172 ProgramPointsBefore, 101 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 1507 VarBasedMoverChecksPositive, 11 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={0:0}] [L1124] 0 \read(t) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 0; [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 0; [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 0; [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={12:0}, t4={10:0}, t5={8:0}, v={6:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 76.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 2133 SDtfs, 11206 SDslu, 15603 SDs, 0 SdLazy, 11571 SolverSat, 1334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2525 GetRequests, 1676 SyntacticMatches, 1 SemanticMatches, 848 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13317 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4116occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 20314 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...