/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:34:34,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:34:34,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:34:34,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:34:34,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:34:34,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:34:34,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:34:34,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:34:34,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:34:34,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:34:34,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:34:34,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:34:34,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:34:34,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:34:34,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:34:34,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:34:34,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:34:34,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:34:34,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:34:34,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:34:34,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:34:34,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:34:34,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:34:34,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:34:34,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:34:34,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:34:34,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:34:34,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:34:34,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:34:34,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:34:34,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:34:34,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:34:34,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:34:34,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:34:34,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:34:34,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:34:34,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:34:34,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:34:34,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:34:34,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:34:34,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:34:34,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:34:34,628 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:34:34,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:34:34,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:34:34,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:34:34,630 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:34:34,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:34:34,630 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:34:34,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:34:34,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:34:34,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:34:34,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:34:34,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:34:34,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:34:34,633 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:34:34,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:34:34,633 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:34:34,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:34:34,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:34:34,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:34:34,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:34:34,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:34:34,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:34:34,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:34:34,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:34:34,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:34:34,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:34:34,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:34:34,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:34:34,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:34:34,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:34:34,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:34:34,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:34:34,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:34:34,975 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:34:34,976 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:34:34,976 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-15 18:34:35,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109ac119f/3b8c82ab8dd74df9b2d2f049e8ab3e96/FLAGc009f45c3 [2020-10-15 18:34:35,532 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:34:35,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-15 18:34:35,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109ac119f/3b8c82ab8dd74df9b2d2f049e8ab3e96/FLAGc009f45c3 [2020-10-15 18:34:35,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109ac119f/3b8c82ab8dd74df9b2d2f049e8ab3e96 [2020-10-15 18:34:35,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:34:35,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:34:35,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:34:35,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:34:35,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:34:35,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:34:35" (1/1) ... [2020-10-15 18:34:35,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:35, skipping insertion in model container [2020-10-15 18:34:35,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:34:35" (1/1) ... [2020-10-15 18:34:35,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:34:35,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:34:36,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:34:36,422 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:34:36,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:34:36,567 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:34:36,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36 WrapperNode [2020-10-15 18:34:36,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:34:36,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:34:36,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:34:36,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:34:36,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:34:36,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:34:36,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:34:36,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:34:36,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (1/1) ... [2020-10-15 18:34:36,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:34:36,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:34:36,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:34:36,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:34:36,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (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-10-15 18:34:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:34:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:34:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:34:36,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:34:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:34:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:34:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:34:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:34:36,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:34:36,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:34:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:34:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:34:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:34:36,758 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:34:38,593 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:34:38,594 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:34:38,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:34:38 BoogieIcfgContainer [2020-10-15 18:34:38,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:34:38,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:34:38,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:34:38,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:34:38,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:34:35" (1/3) ... [2020-10-15 18:34:38,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffafc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:34:38, skipping insertion in model container [2020-10-15 18:34:38,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:34:36" (2/3) ... [2020-10-15 18:34:38,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffafc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:34:38, skipping insertion in model container [2020-10-15 18:34:38,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:34:38" (3/3) ... [2020-10-15 18:34:38,604 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2020-10-15 18:34:38,615 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:34:38,616 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:34:38,623 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:34:38,624 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:34:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,652 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,653 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,654 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,659 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,660 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,667 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,668 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,668 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:34:38,693 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 18:34:38,713 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:34:38,713 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:34:38,713 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:34:38,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:34:38,713 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:34:38,714 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:34:38,714 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:34:38,714 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:34:38,727 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:34:38,730 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-15 18:34:38,733 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-15 18:34:38,735 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-15 18:34:38,780 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-15 18:34:38,781 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:34:38,786 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-15 18:34:38,789 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-15 18:34:39,037 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-10-15 18:34:39,630 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:34:39,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:39,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:39,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:39,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:39,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:39,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:39,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:39,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:39,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:39,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:39,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:39,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:39,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:39,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:39,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:39,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:39,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:39,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:39,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:39,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:40,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:40,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:40,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:40,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:40,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:40,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:40,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:40,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:40,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:40,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:40,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:40,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:40,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,744 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:34:40,847 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:34:40,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:40,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:40,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:40,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:40,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:40,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:40,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:40,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:40,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:40,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:40,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-15 18:34:41,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-15 18:34:41,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-15 18:34:41,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:41,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:41,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:41,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:41,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:41,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:41,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 18:34:41,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:34:41,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:41,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:41,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:34:41,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:34:41,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:34:41,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:41,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:34:41,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:42,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:42,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:42,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:42,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:42,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:34:42,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:42,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:42,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:43,568 WARN L193 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-15 18:34:43,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-15 18:34:43,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:43,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:43,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:44,438 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-15 18:34:44,834 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-15 18:34:46,167 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-15 18:34:46,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-15 18:34:46,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:46,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 18:34:46,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:34:47,228 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-15 18:34:47,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:34:47,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:34:47,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:34:47,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:34:47,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:34:47,575 INFO L132 LiptonReduction]: Checked pairs total: 4070 [2020-10-15 18:34:47,576 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-15 18:34:47,584 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-15 18:34:47,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-15 18:34:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-15 18:34:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 18:34:47,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:47,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 18:34:47,636 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:47,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-15 18:34:47,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:47,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832328324] [2020-10-15 18:34:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:47,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832328324] [2020-10-15 18:34:47,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:47,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:34:47,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036341264] [2020-10-15 18:34:47,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:34:47,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:47,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:34:47,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:34:47,885 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-15 18:34:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:47,987 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-15 18:34:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:34:47,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 18:34:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:48,008 INFO L225 Difference]: With dead ends: 552 [2020-10-15 18:34:48,009 INFO L226 Difference]: Without dead ends: 452 [2020-10-15 18:34:48,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-15 18:34:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-15 18:34:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-15 18:34:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-15 18:34:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-15 18:34:48,111 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-15 18:34:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:48,111 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-15 18:34:48,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:34:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-15 18:34:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:34:48,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:48,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:48,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:34:48,114 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-15 18:34:48,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:48,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672610811] [2020-10-15 18:34:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:48,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672610811] [2020-10-15 18:34:48,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:48,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:34:48,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021782402] [2020-10-15 18:34:48,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:34:48,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:34:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:34:48,246 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-15 18:34:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:48,262 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-10-15 18:34:48,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:34:48,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:34:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:48,267 INFO L225 Difference]: With dead ends: 442 [2020-10-15 18:34:48,267 INFO L226 Difference]: Without dead ends: 442 [2020-10-15 18:34:48,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-15 18:34:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-15 18:34:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-15 18:34:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-15 18:34:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-10-15 18:34:48,284 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9 [2020-10-15 18:34:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:48,286 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-10-15 18:34:48,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:34:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-10-15 18:34:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:34:48,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:48,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:48,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:34:48,288 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-15 18:34:48,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:48,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915680116] [2020-10-15 18:34:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:48,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915680116] [2020-10-15 18:34:48,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:48,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:34:48,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722074373] [2020-10-15 18:34:48,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:34:48,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:48,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:34:48,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:34:48,421 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-10-15 18:34:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:48,452 INFO L93 Difference]: Finished difference Result 439 states and 1313 transitions. [2020-10-15 18:34:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:34:48,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-15 18:34:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:48,456 INFO L225 Difference]: With dead ends: 439 [2020-10-15 18:34:48,456 INFO L226 Difference]: Without dead ends: 439 [2020-10-15 18:34:48,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-15 18:34:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-15 18:34:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-15 18:34:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-15 18:34:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions. [2020-10-15 18:34:48,469 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10 [2020-10-15 18:34:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:48,470 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions. [2020-10-15 18:34:48,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:34:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions. [2020-10-15 18:34:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:34:48,472 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:48,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:48,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:34:48,472 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash -872477858, now seen corresponding path program 1 times [2020-10-15 18:34:48,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:48,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686541748] [2020-10-15 18:34:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:48,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686541748] [2020-10-15 18:34:48,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:48,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:34:48,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742526935] [2020-10-15 18:34:48,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:34:48,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:34:48,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:48,547 INFO L87 Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 4 states. [2020-10-15 18:34:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:48,629 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-10-15 18:34:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:34:48,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:34:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:48,636 INFO L225 Difference]: With dead ends: 424 [2020-10-15 18:34:48,636 INFO L226 Difference]: Without dead ends: 424 [2020-10-15 18:34:48,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-15 18:34:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-10-15 18:34:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-15 18:34:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-10-15 18:34:48,651 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11 [2020-10-15 18:34:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:48,651 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-10-15 18:34:48,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:34:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-10-15 18:34:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:34:48,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:48,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:48,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:34:48,658 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:48,658 INFO L82 PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times [2020-10-15 18:34:48,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:48,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851188874] [2020-10-15 18:34:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:48,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851188874] [2020-10-15 18:34:48,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:48,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:34:48,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116243728] [2020-10-15 18:34:48,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:34:48,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:48,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:34:48,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:48,813 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 4 states. [2020-10-15 18:34:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:48,880 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-10-15 18:34:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:34:48,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:34:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:48,893 INFO L225 Difference]: With dead ends: 421 [2020-10-15 18:34:48,893 INFO L226 Difference]: Without dead ends: 421 [2020-10-15 18:34:48,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-15 18:34:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-15 18:34:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-15 18:34:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-10-15 18:34:48,915 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-10-15 18:34:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:48,915 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-10-15 18:34:48,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:34:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-10-15 18:34:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:34:48,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:48,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:48,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:34:48,919 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1277010548, now seen corresponding path program 1 times [2020-10-15 18:34:48,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:48,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835729837] [2020-10-15 18:34:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:48,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835729837] [2020-10-15 18:34:48,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:48,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:34:48,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080091077] [2020-10-15 18:34:48,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:34:48,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:34:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:48,997 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states. [2020-10-15 18:34:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:49,094 INFO L93 Difference]: Finished difference Result 598 states and 1704 transitions. [2020-10-15 18:34:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:34:49,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:34:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:49,098 INFO L225 Difference]: With dead ends: 598 [2020-10-15 18:34:49,099 INFO L226 Difference]: Without dead ends: 445 [2020-10-15 18:34:49,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:34:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-15 18:34:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2020-10-15 18:34:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-15 18:34:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1158 transitions. [2020-10-15 18:34:49,113 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1158 transitions. Word has length 12 [2020-10-15 18:34:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:49,113 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1158 transitions. [2020-10-15 18:34:49,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:34:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1158 transitions. [2020-10-15 18:34:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:34:49,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:49,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:49,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:34:49,115 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:49,116 INFO L82 PathProgramCache]: Analyzing trace with hash 185118520, now seen corresponding path program 1 times [2020-10-15 18:34:49,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:49,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506454049] [2020-10-15 18:34:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:49,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506454049] [2020-10-15 18:34:49,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:49,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:34:49,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681566058] [2020-10-15 18:34:49,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:34:49,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:34:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:49,198 INFO L87 Difference]: Start difference. First operand 409 states and 1158 transitions. Second operand 4 states. [2020-10-15 18:34:49,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:49,269 INFO L93 Difference]: Finished difference Result 423 states and 1182 transitions. [2020-10-15 18:34:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:34:49,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:34:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:49,273 INFO L225 Difference]: With dead ends: 423 [2020-10-15 18:34:49,274 INFO L226 Difference]: Without dead ends: 423 [2020-10-15 18:34:49,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-15 18:34:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2020-10-15 18:34:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-15 18:34:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1182 transitions. [2020-10-15 18:34:49,295 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1182 transitions. Word has length 12 [2020-10-15 18:34:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:49,296 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1182 transitions. [2020-10-15 18:34:49,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:34:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1182 transitions. [2020-10-15 18:34:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:34:49,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:49,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:49,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:34:49,298 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times [2020-10-15 18:34:49,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:49,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069626837] [2020-10-15 18:34:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:49,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069626837] [2020-10-15 18:34:49,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:49,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:34:49,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287716022] [2020-10-15 18:34:49,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:34:49,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:49,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:34:49,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:49,358 INFO L87 Difference]: Start difference. First operand 423 states and 1182 transitions. Second operand 4 states. [2020-10-15 18:34:49,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:49,411 INFO L93 Difference]: Finished difference Result 431 states and 1207 transitions. [2020-10-15 18:34:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:34:49,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:34:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:49,415 INFO L225 Difference]: With dead ends: 431 [2020-10-15 18:34:49,415 INFO L226 Difference]: Without dead ends: 431 [2020-10-15 18:34:49,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-15 18:34:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2020-10-15 18:34:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-15 18:34:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1193 transitions. [2020-10-15 18:34:49,429 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1193 transitions. Word has length 12 [2020-10-15 18:34:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:49,429 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1193 transitions. [2020-10-15 18:34:49,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:34:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1193 transitions. [2020-10-15 18:34:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:34:49,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:49,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:49,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:34:49,431 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:49,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:49,431 INFO L82 PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times [2020-10-15 18:34:49,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:49,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163213578] [2020-10-15 18:34:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:49,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163213578] [2020-10-15 18:34:49,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:49,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:34:49,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868996285] [2020-10-15 18:34:49,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:34:49,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:49,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:34:49,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:49,545 INFO L87 Difference]: Start difference. First operand 427 states and 1193 transitions. Second operand 5 states. [2020-10-15 18:34:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:49,604 INFO L93 Difference]: Finished difference Result 422 states and 1177 transitions. [2020-10-15 18:34:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:34:49,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:34:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:49,608 INFO L225 Difference]: With dead ends: 422 [2020-10-15 18:34:49,608 INFO L226 Difference]: Without dead ends: 422 [2020-10-15 18:34:49,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-15 18:34:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2020-10-15 18:34:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-15 18:34:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1152 transitions. [2020-10-15 18:34:49,620 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1152 transitions. Word has length 12 [2020-10-15 18:34:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:49,621 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1152 transitions. [2020-10-15 18:34:49,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:34:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1152 transitions. [2020-10-15 18:34:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:34:49,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:49,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:49,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:34:49,623 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times [2020-10-15 18:34:49,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:49,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631384392] [2020-10-15 18:34:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:49,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631384392] [2020-10-15 18:34:49,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:49,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:34:49,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637497361] [2020-10-15 18:34:49,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:34:49,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:34:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:34:49,797 INFO L87 Difference]: Start difference. First operand 414 states and 1152 transitions. Second operand 6 states. [2020-10-15 18:34:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:49,923 INFO L93 Difference]: Finished difference Result 410 states and 1138 transitions. [2020-10-15 18:34:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:34:49,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 18:34:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:49,927 INFO L225 Difference]: With dead ends: 410 [2020-10-15 18:34:49,927 INFO L226 Difference]: Without dead ends: 410 [2020-10-15 18:34:49,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:34:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-15 18:34:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394. [2020-10-15 18:34:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-15 18:34:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1106 transitions. [2020-10-15 18:34:49,937 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1106 transitions. Word has length 13 [2020-10-15 18:34:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:49,938 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 1106 transitions. [2020-10-15 18:34:49,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:34:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1106 transitions. [2020-10-15 18:34:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:34:49,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:49,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:49,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:34:49,940 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:49,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1443705354, now seen corresponding path program 1 times [2020-10-15 18:34:49,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:49,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649963044] [2020-10-15 18:34:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:49,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-10-15 18:34:49,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649963044] [2020-10-15 18:34:49,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:49,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:34:49,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623360280] [2020-10-15 18:34:49,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:34:49,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:34:49,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:49,995 INFO L87 Difference]: Start difference. First operand 394 states and 1106 transitions. Second operand 5 states. [2020-10-15 18:34:50,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:50,098 INFO L93 Difference]: Finished difference Result 448 states and 1257 transitions. [2020-10-15 18:34:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:34:50,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 18:34:50,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:50,102 INFO L225 Difference]: With dead ends: 448 [2020-10-15 18:34:50,102 INFO L226 Difference]: Without dead ends: 448 [2020-10-15 18:34:50,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:34:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-15 18:34:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2020-10-15 18:34:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-15 18:34:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1154 transitions. [2020-10-15 18:34:50,113 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1154 transitions. Word has length 13 [2020-10-15 18:34:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:50,114 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1154 transitions. [2020-10-15 18:34:50,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:34:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1154 transitions. [2020-10-15 18:34:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:34:50,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:50,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:50,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:34:50,115 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1442433114, now seen corresponding path program 2 times [2020-10-15 18:34:50,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:50,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919761161] [2020-10-15 18:34:50,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:50,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919761161] [2020-10-15 18:34:50,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:50,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:34:50,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071321472] [2020-10-15 18:34:50,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:34:50,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:50,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:34:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:34:50,198 INFO L87 Difference]: Start difference. First operand 414 states and 1154 transitions. Second operand 6 states. [2020-10-15 18:34:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:50,327 INFO L93 Difference]: Finished difference Result 460 states and 1280 transitions. [2020-10-15 18:34:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:34:50,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 18:34:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:50,332 INFO L225 Difference]: With dead ends: 460 [2020-10-15 18:34:50,332 INFO L226 Difference]: Without dead ends: 460 [2020-10-15 18:34:50,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:34:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-15 18:34:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 434. [2020-10-15 18:34:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-15 18:34:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1219 transitions. [2020-10-15 18:34:50,345 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1219 transitions. Word has length 13 [2020-10-15 18:34:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:50,345 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1219 transitions. [2020-10-15 18:34:50,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:34:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1219 transitions. [2020-10-15 18:34:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:34:50,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:50,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:50,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:34:50,347 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times [2020-10-15 18:34:50,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:50,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697578026] [2020-10-15 18:34:50,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:50,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697578026] [2020-10-15 18:34:50,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:50,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:34:50,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201418298] [2020-10-15 18:34:50,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:34:50,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:34:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:34:50,409 INFO L87 Difference]: Start difference. First operand 434 states and 1219 transitions. Second operand 4 states. [2020-10-15 18:34:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:50,439 INFO L93 Difference]: Finished difference Result 428 states and 1062 transitions. [2020-10-15 18:34:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:34:50,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:34:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:50,441 INFO L225 Difference]: With dead ends: 428 [2020-10-15 18:34:50,441 INFO L226 Difference]: Without dead ends: 314 [2020-10-15 18:34:50,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-15 18:34:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2020-10-15 18:34:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-10-15 18:34:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 757 transitions. [2020-10-15 18:34:50,449 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 757 transitions. Word has length 14 [2020-10-15 18:34:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:50,450 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 757 transitions. [2020-10-15 18:34:50,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:34:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 757 transitions. [2020-10-15 18:34:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:34:50,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:50,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:50,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:34:50,451 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times [2020-10-15 18:34:50,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:50,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553497198] [2020-10-15 18:34:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:50,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553497198] [2020-10-15 18:34:50,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:50,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:34:50,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720186297] [2020-10-15 18:34:50,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:34:50,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:34:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:34:50,535 INFO L87 Difference]: Start difference. First operand 314 states and 757 transitions. Second operand 5 states. [2020-10-15 18:34:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:50,579 INFO L93 Difference]: Finished difference Result 261 states and 577 transitions. [2020-10-15 18:34:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:34:50,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 18:34:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:50,581 INFO L225 Difference]: With dead ends: 261 [2020-10-15 18:34:50,581 INFO L226 Difference]: Without dead ends: 201 [2020-10-15 18:34:50,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:34:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-15 18:34:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2020-10-15 18:34:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-15 18:34:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 409 transitions. [2020-10-15 18:34:50,587 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 409 transitions. Word has length 15 [2020-10-15 18:34:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:50,587 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 409 transitions. [2020-10-15 18:34:50,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:34:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 409 transitions. [2020-10-15 18:34:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:34:50,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:50,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:50,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 18:34:50,589 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times [2020-10-15 18:34:50,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:50,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431571439] [2020-10-15 18:34:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:50,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431571439] [2020-10-15 18:34:50,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:50,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:34:50,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362947547] [2020-10-15 18:34:50,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:34:50,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:34:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:34:50,706 INFO L87 Difference]: Start difference. First operand 191 states and 409 transitions. Second operand 6 states. [2020-10-15 18:34:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:50,756 INFO L93 Difference]: Finished difference Result 172 states and 370 transitions. [2020-10-15 18:34:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:34:50,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 18:34:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:50,758 INFO L225 Difference]: With dead ends: 172 [2020-10-15 18:34:50,758 INFO L226 Difference]: Without dead ends: 117 [2020-10-15 18:34:50,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:34:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-15 18:34:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-10-15 18:34:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-15 18:34:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions. [2020-10-15 18:34:50,764 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17 [2020-10-15 18:34:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:50,765 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 240 transitions. [2020-10-15 18:34:50,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:34:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions. [2020-10-15 18:34:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:34:50,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:50,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:50,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 18:34:50,766 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times [2020-10-15 18:34:50,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:50,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787798294] [2020-10-15 18:34:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:50,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-10-15 18:34:50,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787798294] [2020-10-15 18:34:50,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:50,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:34:50,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247492154] [2020-10-15 18:34:50,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:34:50,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:50,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:34:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:34:50,967 INFO L87 Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 7 states. [2020-10-15 18:34:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:51,112 INFO L93 Difference]: Finished difference Result 145 states and 301 transitions. [2020-10-15 18:34:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:34:51,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-15 18:34:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:51,114 INFO L225 Difference]: With dead ends: 145 [2020-10-15 18:34:51,114 INFO L226 Difference]: Without dead ends: 115 [2020-10-15 18:34:51,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:34:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-15 18:34:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-15 18:34:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-15 18:34:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 192 transitions. [2020-10-15 18:34:51,118 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 192 transitions. Word has length 20 [2020-10-15 18:34:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:51,118 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 192 transitions. [2020-10-15 18:34:51,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:34:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2020-10-15 18:34:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:34:51,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:51,119 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:51,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 18:34:51,119 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:51,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times [2020-10-15 18:34:51,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:51,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561881712] [2020-10-15 18:34:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:34:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:34:51,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561881712] [2020-10-15 18:34:51,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:34:51,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:34:51,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402326911] [2020-10-15 18:34:51,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:34:51,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:34:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:34:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:34:51,343 INFO L87 Difference]: Start difference. First operand 97 states and 192 transitions. Second operand 7 states. [2020-10-15 18:34:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:34:51,498 INFO L93 Difference]: Finished difference Result 123 states and 240 transitions. [2020-10-15 18:34:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:34:51,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-15 18:34:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:34:51,499 INFO L225 Difference]: With dead ends: 123 [2020-10-15 18:34:51,499 INFO L226 Difference]: Without dead ends: 77 [2020-10-15 18:34:51,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:34:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-15 18:34:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-15 18:34:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-15 18:34:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions. [2020-10-15 18:34:51,502 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20 [2020-10-15 18:34:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:34:51,503 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 144 transitions. [2020-10-15 18:34:51,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:34:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2020-10-15 18:34:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:34:51,503 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:34:51,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:34:51,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 18:34:51,504 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:34:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:34:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times [2020-10-15 18:34:51,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:34:51,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787535518] [2020-10-15 18:34:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:34:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:34:51,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:34:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:34:51,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:34:51,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:34:51,607 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:34:51,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 18:34:51,608 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:34:51,620 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In-627131127 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In-627131127 256) 0)) (.cse9 (= 0 (mod ~y$w_buff1_used~0_In-627131127 256))) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-627131127 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out-627131127 ~y$w_buff1_used~0_In-627131127)) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-627131127 0))) (= ~y$r_buff0_thd0~0_In-627131127 ~y$r_buff0_thd0~0_Out-627131127) (or (and .cse3 (= ~y$w_buff0~0_In-627131127 ~y~0_Out-627131127) .cse4) (and (or (and (= ~y~0_In-627131127 ~y~0_Out-627131127) .cse0) (and (= ~y$w_buff1~0_In-627131127 ~y~0_Out-627131127) .cse1 .cse2)) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-627131127 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-627131127|) (= ~y$r_buff1_thd0~0_In-627131127 ~y$r_buff1_thd0~0_Out-627131127) (or (and .cse3 (= ~y$w_buff0_used~0_Out-627131127 0) .cse4) (and .cse5 (= ~y$w_buff0_used~0_In-627131127 ~y$w_buff0_used~0_Out-627131127))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-627131127 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-627131127|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-627131127, ~y$w_buff1~0=~y$w_buff1~0_In-627131127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-627131127, ~y$w_buff0~0=~y$w_buff0~0_In-627131127, ~y~0=~y~0_In-627131127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-627131127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-627131127} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-627131127|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-627131127, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-627131127|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-627131127|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-627131127|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-627131127|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-627131127|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-627131127|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-627131127, ~y$w_buff1~0=~y$w_buff1~0_In-627131127, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-627131127, ~y$w_buff0~0=~y$w_buff0~0_In-627131127, ~y~0=~y~0_Out-627131127, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-627131127, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-627131127} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-15 18:34:51,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,637 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:34:51,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:34:51,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:34:51 BasicIcfg [2020-10-15 18:34:51,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:34:51,755 INFO L168 Benchmark]: Toolchain (without parser) took 15886.80 ms. Allocated memory was 248.0 MB in the beginning and 595.6 MB in the end (delta: 347.6 MB). Free memory was 203.0 MB in the beginning and 552.2 MB in the end (delta: -349.2 MB). Peak memory consumption was 404.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,756 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 18:34:51,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.18 ms. Allocated memory was 248.0 MB in the beginning and 303.0 MB in the end (delta: 55.1 MB). Free memory was 203.0 MB in the beginning and 253.8 MB in the end (delta: -50.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 303.0 MB. Free memory was 253.8 MB in the beginning and 248.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,760 INFO L168 Benchmark]: Boogie Preprocessor took 39.41 ms. Allocated memory is still 303.0 MB. Free memory was 248.6 MB in the beginning and 246.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,766 INFO L168 Benchmark]: RCFGBuilder took 1922.29 ms. Allocated memory was 303.0 MB in the beginning and 353.9 MB in the end (delta: 50.9 MB). Free memory was 246.1 MB in the beginning and 187.2 MB in the end (delta: 58.9 MB). Peak memory consumption was 109.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,766 INFO L168 Benchmark]: TraceAbstraction took 13154.75 ms. Allocated memory was 353.9 MB in the beginning and 595.6 MB in the end (delta: 241.7 MB). Free memory was 183.8 MB in the beginning and 552.2 MB in the end (delta: -368.5 MB). Peak memory consumption was 279.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:34:51,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 699.18 ms. Allocated memory was 248.0 MB in the beginning and 303.0 MB in the end (delta: 55.1 MB). Free memory was 203.0 MB in the beginning and 253.8 MB in the end (delta: -50.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 303.0 MB. Free memory was 253.8 MB in the beginning and 248.6 MB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.41 ms. Allocated memory is still 303.0 MB. Free memory was 248.6 MB in the beginning and 246.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1922.29 ms. Allocated memory was 303.0 MB in the beginning and 353.9 MB in the end (delta: 50.9 MB). Free memory was 246.1 MB in the beginning and 187.2 MB in the end (delta: 58.9 MB). Peak memory consumption was 109.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13154.75 ms. Allocated memory was 353.9 MB in the beginning and 595.6 MB in the end (delta: 241.7 MB). Free memory was 183.8 MB in the beginning and 552.2 MB in the end (delta: -368.5 MB). Peak memory consumption was 279.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 896 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.8s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4070 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2186; [L803] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2187; [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L806] 0 pthread_t t2188; [L807] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.9s, HoareTripleCheckerStatistics: 321 SDtfs, 421 SDslu, 528 SDs, 0 SdLazy, 408 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 156 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 24937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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...