/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 23:29:16,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 23:29:16,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 23:29:16,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 23:29:16,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 23:29:16,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 23:29:16,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 23:29:16,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 23:29:16,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 23:29:16,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 23:29:16,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 23:29:16,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 23:29:16,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 23:29:16,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 23:29:16,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 23:29:16,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 23:29:16,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 23:29:16,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 23:29:16,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 23:29:16,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 23:29:16,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 23:29:16,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 23:29:16,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 23:29:16,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 23:29:16,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 23:29:16,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 23:29:16,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 23:29:16,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 23:29:16,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 23:29:16,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 23:29:16,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 23:29:16,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 23:29:16,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 23:29:16,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 23:29:16,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 23:29:16,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 23:29:16,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 23:29:16,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 23:29:16,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 23:29:16,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 23:29:16,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 23:29:16,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-11 23:29:16,676 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 23:29:16,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 23:29:16,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 23:29:16,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 23:29:16,682 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 23:29:16,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 23:29:16,683 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 23:29:16,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 23:29:16,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 23:29:16,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 23:29:16,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 23:29:16,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 23:29:16,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 23:29:16,685 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 23:29:16,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 23:29:16,686 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 23:29:16,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 23:29:16,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 23:29:16,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 23:29:16,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 23:29:16,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 23:29:16,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:29:16,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 23:29:16,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 23:29:16,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 23:29:16,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 23:29:16,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 23:29:16,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 23:29:16,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-11 23:29:17,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 23:29:17,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 23:29:17,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 23:29:17,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 23:29:17,129 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 23:29:17,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-11-11 23:29:17,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bedbb9c/7a37a9716f1c484ebe709b26e55f7295/FLAGdf2255541 [2020-11-11 23:29:17,936 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 23:29:17,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2020-11-11 23:29:17,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bedbb9c/7a37a9716f1c484ebe709b26e55f7295/FLAGdf2255541 [2020-11-11 23:29:18,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8bedbb9c/7a37a9716f1c484ebe709b26e55f7295 [2020-11-11 23:29:18,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 23:29:18,194 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 23:29:18,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 23:29:18,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 23:29:18,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 23:29:18,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:18,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651bc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18, skipping insertion in model container [2020-11-11 23:29:18,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:18,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 23:29:18,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 23:29:18,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:29:18,739 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 23:29:18,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 23:29:18,908 INFO L208 MainTranslator]: Completed translation [2020-11-11 23:29:18,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18 WrapperNode [2020-11-11 23:29:18,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 23:29:18,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 23:29:18,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 23:29:18,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 23:29:18,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:18,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:18,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 23:29:18,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 23:29:18,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 23:29:18,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 23:29:18,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:18,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... [2020-11-11 23:29:19,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 23:29:19,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 23:29:19,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 23:29:19,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 23:29:19,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 23:29:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 23:29:19,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 23:29:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 23:29:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 23:29:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 23:29:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 23:29:19,133 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 23:29:19,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 23:29:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 23:29:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 23:29:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 23:29:19,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 23:29:19,136 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 23:29:21,208 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 23:29:21,209 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 23:29:21,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:29:21 BoogieIcfgContainer [2020-11-11 23:29:21,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 23:29:21,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 23:29:21,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 23:29:21,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 23:29:21,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 11:29:18" (1/3) ... [2020-11-11 23:29:21,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ecc14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:29:21, skipping insertion in model container [2020-11-11 23:29:21,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:29:18" (2/3) ... [2020-11-11 23:29:21,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ecc14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 11:29:21, skipping insertion in model container [2020-11-11 23:29:21,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:29:21" (3/3) ... [2020-11-11 23:29:21,220 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2020-11-11 23:29:21,237 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 23:29:21,237 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 23:29:21,241 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 23:29:21,242 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 23:29:21,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,276 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,276 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,281 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,285 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,295 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,295 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 23:29:21,303 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 23:29:21,316 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-11 23:29:21,339 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 23:29:21,339 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 23:29:21,339 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 23:29:21,340 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 23:29:21,340 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 23:29:21,340 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 23:29:21,340 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 23:29:21,340 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 23:29:21,353 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-11 23:29:21,356 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 87 transitions, 184 flow [2020-11-11 23:29:21,359 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 87 transitions, 184 flow [2020-11-11 23:29:21,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 87 transitions, 184 flow [2020-11-11 23:29:21,406 INFO L129 PetriNetUnfolder]: 3/85 cut-off events. [2020-11-11 23:29:21,406 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-11 23:29:21,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 3/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-11-11 23:29:21,413 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-11-11 23:29:22,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:29:22,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:22,430 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-11 23:29:22,551 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-11 23:29:22,663 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-11 23:29:22,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-11 23:29:22,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:23,077 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-11 23:29:23,192 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-11 23:29:23,755 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-11 23:29:23,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-11 23:29:23,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:24,202 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-11 23:29:24,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:24,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:24,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:24,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:24,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:24,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:24,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:24,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:24,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:24,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:24,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:29:24,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:29:24,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:24,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:24,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:24,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:25,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-11 23:29:25,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:25,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:25,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:29:25,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:29:25,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:25,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-11 23:29:25,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-11 23:29:25,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:25,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-11 23:29:25,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-11 23:29:25,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-11 23:29:25,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-11 23:29:25,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:25,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:25,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:25,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:25,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,273 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-11 23:29:26,466 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-11 23:29:26,682 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-11 23:29:26,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-11-11 23:29:26,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:26,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-11 23:29:26,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:29:26,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-11 23:29:26,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:26,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:26,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:26,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:26,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-11 23:29:26,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:26,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-11 23:29:26,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-11 23:29:27,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-11 23:29:27,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-11 23:29:27,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:27,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-11 23:29:27,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-11 23:29:28,697 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-11 23:29:28,809 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-11 23:29:28,919 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-11 23:29:29,031 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-11 23:29:29,178 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-11 23:29:29,319 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-11 23:29:29,443 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-11 23:29:29,568 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-11 23:29:30,012 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-11 23:29:30,221 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-11 23:29:30,644 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2020-11-11 23:29:30,847 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-11 23:29:30,851 INFO L131 LiptonReduction]: Checked pairs total: 3613 [2020-11-11 23:29:30,852 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-11-11 23:29:30,860 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-11-11 23:29:30,899 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 252 states, 248 states have (on average 2.6693548387096775) internal successors, (662), 251 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 252 states, 248 states have (on average 2.6693548387096775) internal successors, (662), 251 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-11 23:29:30,911 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:30,912 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-11 23:29:30,912 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 922153046, now seen corresponding path program 1 times [2020-11-11 23:29:30,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:30,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183252440] [2020-11-11 23:29:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:31,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183252440] [2020-11-11 23:29:31,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:31,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-11 23:29:31,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779238335] [2020-11-11 23:29:31,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 23:29:31,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 23:29:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 23:29:31,292 INFO L87 Difference]: Start difference. First operand has 252 states, 248 states have (on average 2.6693548387096775) internal successors, (662), 251 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:31,377 INFO L93 Difference]: Finished difference Result 222 states and 543 transitions. [2020-11-11 23:29:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 23:29:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2020-11-11 23:29:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:31,392 INFO L225 Difference]: With dead ends: 222 [2020-11-11 23:29:31,392 INFO L226 Difference]: Without dead ends: 187 [2020-11-11 23:29:31,393 INFO L749 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-11-11 23:29:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-11-11 23:29:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-11-11 23:29:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.4193548387096775) internal successors, (450), 186 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 450 transitions. [2020-11-11 23:29:31,455 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 450 transitions. Word has length 5 [2020-11-11 23:29:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:31,456 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 450 transitions. [2020-11-11 23:29:31,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 450 transitions. [2020-11-11 23:29:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-11 23:29:31,457 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:31,457 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:31,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 23:29:31,457 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:31,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1251883775, now seen corresponding path program 1 times [2020-11-11 23:29:31,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:31,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387111839] [2020-11-11 23:29:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:31,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387111839] [2020-11-11 23:29:31,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:31,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:29:31,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685768428] [2020-11-11 23:29:31,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:29:31,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:29:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:29:31,722 INFO L87 Difference]: Start difference. First operand 187 states and 450 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:31,765 INFO L93 Difference]: Finished difference Result 192 states and 439 transitions. [2020-11-11 23:29:31,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:29:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2020-11-11 23:29:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:31,768 INFO L225 Difference]: With dead ends: 192 [2020-11-11 23:29:31,768 INFO L226 Difference]: Without dead ends: 157 [2020-11-11 23:29:31,769 INFO L749 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-11-11 23:29:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-11 23:29:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-11-11 23:29:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.3461538461538463) internal successors, (366), 156 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 366 transitions. [2020-11-11 23:29:31,782 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 366 transitions. Word has length 8 [2020-11-11 23:29:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:31,782 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 366 transitions. [2020-11-11 23:29:31,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 366 transitions. [2020-11-11 23:29:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-11 23:29:31,784 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:31,784 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:31,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 23:29:31,784 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1044513333, now seen corresponding path program 1 times [2020-11-11 23:29:31,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:31,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583555669] [2020-11-11 23:29:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:31,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583555669] [2020-11-11 23:29:31,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:31,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 23:29:31,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135328958] [2020-11-11 23:29:31,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:29:31,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:31,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:29:31,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:29:31,937 INFO L87 Difference]: Start difference. First operand 157 states and 366 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:31,974 INFO L93 Difference]: Finished difference Result 167 states and 374 transitions. [2020-11-11 23:29:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:29:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2020-11-11 23:29:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:31,976 INFO L225 Difference]: With dead ends: 167 [2020-11-11 23:29:31,977 INFO L226 Difference]: Without dead ends: 147 [2020-11-11 23:29:31,977 INFO L749 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-11-11 23:29:31,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-11 23:29:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-11-11 23:29:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.315068493150685) internal successors, (338), 146 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 338 transitions. [2020-11-11 23:29:31,987 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 338 transitions. Word has length 11 [2020-11-11 23:29:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:31,987 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 338 transitions. [2020-11-11 23:29:31,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 338 transitions. [2020-11-11 23:29:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-11 23:29:31,989 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:31,989 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:31,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 23:29:31,989 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:31,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1979788407, now seen corresponding path program 1 times [2020-11-11 23:29:31,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:31,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8796688] [2020-11-11 23:29:31,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:32,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-11-11 23:29:32,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8796688] [2020-11-11 23:29:32,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:32,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:29:32,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317239300] [2020-11-11 23:29:32,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:29:32,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:32,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:29:32,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:29:32,199 INFO L87 Difference]: Start difference. First operand 147 states and 338 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:32,338 INFO L93 Difference]: Finished difference Result 182 states and 402 transitions. [2020-11-11 23:29:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:29:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2020-11-11 23:29:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:32,342 INFO L225 Difference]: With dead ends: 182 [2020-11-11 23:29:32,342 INFO L226 Difference]: Without dead ends: 165 [2020-11-11 23:29:32,343 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:29:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-11-11 23:29:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-11-11 23:29:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.268292682926829) internal successors, (372), 164 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 372 transitions. [2020-11-11 23:29:32,365 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 372 transitions. Word has length 12 [2020-11-11 23:29:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:32,366 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 372 transitions. [2020-11-11 23:29:32,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 372 transitions. [2020-11-11 23:29:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-11 23:29:32,370 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:32,370 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:32,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 23:29:32,370 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:32,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1243860874, now seen corresponding path program 1 times [2020-11-11 23:29:32,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:32,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759294548] [2020-11-11 23:29:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:32,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-11-11 23:29:32,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759294548] [2020-11-11 23:29:32,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:32,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:29:32,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418452154] [2020-11-11 23:29:32,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:29:32,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:29:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:29:32,551 INFO L87 Difference]: Start difference. First operand 165 states and 372 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:32,596 INFO L93 Difference]: Finished difference Result 241 states and 533 transitions. [2020-11-11 23:29:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:29:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-11 23:29:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:32,597 INFO L225 Difference]: With dead ends: 241 [2020-11-11 23:29:32,598 INFO L226 Difference]: Without dead ends: 105 [2020-11-11 23:29:32,598 INFO L749 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-11-11 23:29:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-11 23:29:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-11-11 23:29:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.2115384615384617) internal successors, (230), 104 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 230 transitions. [2020-11-11 23:29:32,603 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 230 transitions. Word has length 13 [2020-11-11 23:29:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:32,603 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 230 transitions. [2020-11-11 23:29:32,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 230 transitions. [2020-11-11 23:29:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-11 23:29:32,609 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:32,609 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:32,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 23:29:32,610 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 781202481, now seen corresponding path program 1 times [2020-11-11 23:29:32,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:32,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489618571] [2020-11-11 23:29:32,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:32,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489618571] [2020-11-11 23:29:32,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:32,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:29:32,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649775374] [2020-11-11 23:29:32,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:29:32,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:29:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:29:32,755 INFO L87 Difference]: Start difference. First operand 105 states and 230 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:32,819 INFO L93 Difference]: Finished difference Result 163 states and 357 transitions. [2020-11-11 23:29:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:29:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-11 23:29:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:32,820 INFO L225 Difference]: With dead ends: 163 [2020-11-11 23:29:32,820 INFO L226 Difference]: Without dead ends: 93 [2020-11-11 23:29:32,821 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-11 23:29:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-11 23:29:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-11-11 23:29:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.152173913043478) internal successors, (198), 92 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 198 transitions. [2020-11-11 23:29:32,825 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 198 transitions. Word has length 14 [2020-11-11 23:29:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:32,826 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 198 transitions. [2020-11-11 23:29:32,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 198 transitions. [2020-11-11 23:29:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-11 23:29:32,827 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:32,827 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:32,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 23:29:32,827 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:32,827 INFO L82 PathProgramCache]: Analyzing trace with hash 95077311, now seen corresponding path program 2 times [2020-11-11 23:29:32,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:32,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779915267] [2020-11-11 23:29:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:32,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779915267] [2020-11-11 23:29:32,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:32,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-11 23:29:32,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245494842] [2020-11-11 23:29:32,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-11 23:29:32,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:32,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-11 23:29:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-11 23:29:32,936 INFO L87 Difference]: Start difference. First operand 93 states and 198 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:32,971 INFO L93 Difference]: Finished difference Result 78 states and 139 transitions. [2020-11-11 23:29:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-11 23:29:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2020-11-11 23:29:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:32,974 INFO L225 Difference]: With dead ends: 78 [2020-11-11 23:29:32,974 INFO L226 Difference]: Without dead ends: 55 [2020-11-11 23:29:32,974 INFO L749 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-11-11 23:29:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-11-11 23:29:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-11-11 23:29:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2020-11-11 23:29:32,978 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 14 [2020-11-11 23:29:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:32,978 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 90 transitions. [2020-11-11 23:29:32,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 90 transitions. [2020-11-11 23:29:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-11 23:29:32,979 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:32,979 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:32,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 23:29:32,980 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 359732847, now seen corresponding path program 1 times [2020-11-11 23:29:32,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:32,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315406428] [2020-11-11 23:29:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:33,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315406428] [2020-11-11 23:29:33,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:33,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-11 23:29:33,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942387085] [2020-11-11 23:29:33,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 23:29:33,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 23:29:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-11 23:29:33,132 INFO L87 Difference]: Start difference. First operand 55 states and 90 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:33,175 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2020-11-11 23:29:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 23:29:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-11 23:29:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:33,177 INFO L225 Difference]: With dead ends: 39 [2020-11-11 23:29:33,177 INFO L226 Difference]: Without dead ends: 31 [2020-11-11 23:29:33,177 INFO L749 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-11-11 23:29:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-11 23:29:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-11 23:29:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-11-11 23:29:33,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 15 [2020-11-11 23:29:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:33,181 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-11-11 23:29:33,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-11-11 23:29:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-11 23:29:33,181 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:33,181 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:33,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 23:29:33,182 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash -868648877, now seen corresponding path program 1 times [2020-11-11 23:29:33,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:33,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317968828] [2020-11-11 23:29:33,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 23:29:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 23:29:33,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317968828] [2020-11-11 23:29:33,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 23:29:33,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 23:29:33,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255345803] [2020-11-11 23:29:33,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 23:29:33,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 23:29:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 23:29:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-11 23:29:33,571 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 23:29:33,833 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2020-11-11 23:29:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-11 23:29:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2020-11-11 23:29:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 23:29:33,834 INFO L225 Difference]: With dead ends: 48 [2020-11-11 23:29:33,835 INFO L226 Difference]: Without dead ends: 35 [2020-11-11 23:29:33,835 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-11 23:29:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-11 23:29:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-11-11 23:29:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-11-11 23:29:33,839 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2020-11-11 23:29:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 23:29:33,840 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-11-11 23:29:33,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 23:29:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-11-11 23:29:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-11 23:29:33,840 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 23:29:33,840 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 23:29:33,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 23:29:33,841 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 23:29:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 23:29:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 94528979, now seen corresponding path program 2 times [2020-11-11 23:29:33,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 23:29:33,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760747434] [2020-11-11 23:29:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 23:29:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:29:33,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:29:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 23:29:33,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 23:29:34,043 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 23:29:34,044 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 23:29:34,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 23:29:34,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 11:29:34 BasicIcfg [2020-11-11 23:29:34,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 23:29:34,178 INFO L168 Benchmark]: Toolchain (without parser) took 15990.58 ms. Allocated memory was 302.0 MB in the beginning and 450.9 MB in the end (delta: 148.9 MB). Free memory was 277.1 MB in the beginning and 192.5 MB in the end (delta: 84.7 MB). Peak memory consumption was 235.3 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,178 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 23:29:34,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 714.14 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 243.2 MB in the end (delta: 33.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.70 ms. Allocated memory is still 302.0 MB. Free memory was 243.2 MB in the beginning and 282.4 MB in the end (delta: -39.2 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,182 INFO L168 Benchmark]: Boogie Preprocessor took 67.99 ms. Allocated memory is still 302.0 MB. Free memory was 282.4 MB in the beginning and 280.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,183 INFO L168 Benchmark]: RCFGBuilder took 2153.46 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 280.3 MB in the beginning and 304.2 MB in the end (delta: -23.9 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,186 INFO L168 Benchmark]: TraceAbstraction took 12962.18 ms. Allocated memory was 362.8 MB in the beginning and 450.9 MB in the end (delta: 88.1 MB). Free memory was 304.2 MB in the beginning and 192.5 MB in the end (delta: 111.7 MB). Peak memory consumption was 199.8 MB. Max. memory is 16.0 GB. [2020-11-11 23:29:34,193 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 714.14 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 243.2 MB in the end (delta: 33.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 76.70 ms. Allocated memory is still 302.0 MB. Free memory was 243.2 MB in the beginning and 282.4 MB in the end (delta: -39.2 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 67.99 ms. Allocated memory is still 302.0 MB. Free memory was 282.4 MB in the beginning and 280.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2153.46 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 280.3 MB in the beginning and 304.2 MB in the end (delta: -23.9 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12962.18 ms. Allocated memory was 362.8 MB in the beginning and 450.9 MB in the end (delta: 88.1 MB). Free memory was 304.2 MB in the beginning and 192.5 MB in the end (delta: 111.7 MB). Peak memory consumption was 199.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 860 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 107 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 91 PlacesBefore, 29 PlacesAfterwards, 87 TransitionsBefore, 23 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 3613 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L821] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L822] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L823] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L824] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L825] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi000_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 85 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 201 SDtfs, 168 SDslu, 328 SDs, 0 SdLazy, 169 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 8214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...