/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:32:05,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:32:05,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:32:05,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:32:05,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:32:05,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:32:05,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:32:05,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:32:05,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:32:05,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:32:05,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:32:05,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:32:05,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:32:05,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:32:05,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:32:05,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:32:05,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:32:05,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:32:05,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:32:05,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:32:05,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:32:05,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:32:05,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:32:05,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:32:05,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:32:05,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:32:05,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:32:05,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:32:05,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:32:05,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:32:05,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:32:05,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:32:05,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:32:05,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:32:05,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:32:05,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:32:05,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:32:05,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:32:05,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:32:05,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:32:05,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:32:05,819 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:32:05,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:32:05,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:32:05,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:32:05,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:32:05,868 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:32:05,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:32:05,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:32:05,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:32:05,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:32:05,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:32:05,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:32:05,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:32:05,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:32:05,870 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:32:05,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:32:05,870 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:32:05,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:32:05,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:32:05,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:32:05,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:32:05,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:32:05,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:32:05,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:32:05,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:32:05,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:32:05,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:32:05,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:32:05,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:32:05,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:32:05,873 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-09 12:32:06,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:32:06,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:32:06,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:32:06,287 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:32:06,288 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:32:06,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-11-09 12:32:06,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfb4d276/58ad1779f17342cdbdac25aa2f7482da/FLAG315d04924 [2020-11-09 12:32:07,102 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:32:07,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-11-09 12:32:07,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfb4d276/58ad1779f17342cdbdac25aa2f7482da/FLAG315d04924 [2020-11-09 12:32:07,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bfb4d276/58ad1779f17342cdbdac25aa2f7482da [2020-11-09 12:32:07,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:32:07,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:32:07,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:32:07,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:32:07,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:32:07,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:07" (1/1) ... [2020-11-09 12:32:07,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b7f039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:07, skipping insertion in model container [2020-11-09 12:32:07,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:07" (1/1) ... [2020-11-09 12:32:07,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:32:07,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:32:07,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:32:07,905 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:32:08,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:32:08,145 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:32:08,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08 WrapperNode [2020-11-09 12:32:08,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:32:08,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:32:08,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:32:08,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:32:08,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:32:08,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:32:08,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:32:08,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:32:08,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (1/1) ... [2020-11-09 12:32:08,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:32:08,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:32:08,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:32:08,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:32:08,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (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-09 12:32:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:32:08,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:32:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:32:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:32:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:32:08,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:32:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:32:08,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:32:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:32:08,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:32:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 12:32:08,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 12:32:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:32:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:32:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:32:08,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:32:08,443 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:32:10,680 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:32:10,681 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:32:10,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:10 BoogieIcfgContainer [2020-11-09 12:32:10,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:32:10,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:32:10,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:32:10,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:32:10,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:07" (1/3) ... [2020-11-09 12:32:10,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:10, skipping insertion in model container [2020-11-09 12:32:10,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:08" (2/3) ... [2020-11-09 12:32:10,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:10, skipping insertion in model container [2020-11-09 12:32:10,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:10" (3/3) ... [2020-11-09 12:32:10,692 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2020-11-09 12:32:10,709 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:32:10,710 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:32:10,714 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:32:10,715 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:32:10,765 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,766 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,767 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,767 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,771 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,771 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,777 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,777 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,778 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,778 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,778 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,780 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,781 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,790 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,793 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,795 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,799 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,799 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:32:10,806 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:32:10,820 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 12:32:10,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:32:10,846 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:32:10,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:32:10,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:32:10,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:32:10,846 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:32:10,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:32:10,847 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:32:10,861 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:32:10,864 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-09 12:32:10,868 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-09 12:32:10,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-09 12:32:10,927 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-09 12:32:10,928 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:32:10,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 12:32:10,938 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-09 12:32:11,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:11,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:11,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:11,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:11,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:12,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-09 12:32:12,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:12,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 12:32:12,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:12,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-09 12:32:12,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:12,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 12:32:12,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:13,420 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-09 12:32:13,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-09 12:32:13,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:13,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 12:32:13,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:14,992 WARN L194 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-11-09 12:32:17,490 WARN L194 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2020-11-09 12:32:17,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,511 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-11-09 12:32:17,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-11-09 12:32:17,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 12:32:17,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:17,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 1] term [2020-11-09 12:32:17,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 12:32:17,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 12:32:17,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:17,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:17,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:32:17,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:32:17,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:17,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:32:17,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:17,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:32:17,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:17,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:17,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:32:17,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:17,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:32:17,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:20,890 WARN L194 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 386 DAG size of output: 281 [2020-11-09 12:32:21,305 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 12:32:21,454 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 12:32:21,594 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 12:32:21,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:21,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:21,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:21,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:21,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:21,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:21,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:21,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:21,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:21,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:21,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:21,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:21,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:21,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:21,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:21,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:22,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:22,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:22,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:22,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:22,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:22,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:22,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:22,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:22,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:22,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:22,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:22,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:22,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:22,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:22,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:22,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:22,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:22,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:22,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:22,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:23,735 WARN L194 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 12:32:23,856 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:32:24,522 WARN L194 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-09 12:32:24,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:32:24,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:25,023 WARN L194 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 12:32:25,877 WARN L194 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-09 12:32:26,337 WARN L194 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-09 12:32:27,684 WARN L194 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 265 [2020-11-09 12:32:29,104 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 265 [2020-11-09 12:32:29,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:32:29,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:29,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:29,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:29,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:29,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:29,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:29,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:31,147 WARN L194 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 1 [2020-11-09 12:32:32,396 WARN L194 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2020-11-09 12:32:32,845 WARN L194 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 12:32:35,230 WARN L194 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 268 DAG size of output: 224 [2020-11-09 12:32:36,368 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 223 [2020-11-09 12:32:36,666 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-09 12:32:36,863 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-09 12:32:37,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-09 12:32:37,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-09 12:32:37,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:37,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:37,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:37,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:37,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:37,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:37,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:37,179 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:32:37,290 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:32:37,404 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:32:37,517 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-11-09 12:32:37,687 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 12:32:37,820 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 12:32:37,945 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 12:32:38,072 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-11-09 12:32:40,353 WARN L194 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 145 DAG size of output: 135 [2020-11-09 12:32:41,113 WARN L194 SmtUtils]: Spent 757.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-09 12:32:43,767 WARN L194 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 282 DAG size of output: 268 [2020-11-09 12:32:45,093 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 267 [2020-11-09 12:32:45,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-09 12:32:45,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-09 12:32:45,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:45,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:45,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:45,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:45,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:45,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:32:45,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:32:45,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:45,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-09 12:32:45,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-09 12:32:45,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:32:45,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-09 12:32:45,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-09 12:32:45,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:32:45,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-09 12:32:45,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:45,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:32:45,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:32:46,500 WARN L194 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-09 12:32:46,845 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-09 12:32:47,581 WARN L194 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-09 12:32:47,929 WARN L194 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-09 12:32:48,815 WARN L194 SmtUtils]: Spent 857.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 12:32:49,669 WARN L194 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 12:32:52,762 WARN L194 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 281 DAG size of output: 279 [2020-11-09 12:32:54,393 WARN L194 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 278 [2020-11-09 12:32:54,464 INFO L131 LiptonReduction]: Checked pairs total: 6354 [2020-11-09 12:32:54,465 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-09 12:32:54,471 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-11-09 12:32:54,697 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-11-09 12:32:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-11-09 12:32:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:32:54,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:54,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:54,712 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:54,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2090102638, now seen corresponding path program 1 times [2020-11-09 12:32:54,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:54,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593093694] [2020-11-09 12:32:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:55,093 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-09 12:32:55,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593093694] [2020-11-09 12:32:55,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:55,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:32:55,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120091461] [2020-11-09 12:32:55,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:32:55,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:32:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:55,131 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-11-09 12:32:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:55,320 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-09 12:32:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:32:55,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 12:32:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:55,370 INFO L225 Difference]: With dead ends: 2602 [2020-11-09 12:32:55,370 INFO L226 Difference]: Without dead ends: 2122 [2020-11-09 12:32:55,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:55,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-09 12:32:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-11-09 12:32:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-09 12:32:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-11-09 12:32:55,567 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-11-09 12:32:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:55,569 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-11-09 12:32:55,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:32:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-11-09 12:32:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:32:55,572 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:55,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:55,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:32:55,573 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:55,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1455991290, now seen corresponding path program 1 times [2020-11-09 12:32:55,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:55,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569553946] [2020-11-09 12:32:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:32:55,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569553946] [2020-11-09 12:32:55,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:55,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:32:55,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343530562] [2020-11-09 12:32:55,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:32:55,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:32:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:55,708 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-11-09 12:32:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:55,795 INFO L93 Difference]: Finished difference Result 2042 states and 7736 transitions. [2020-11-09 12:32:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:32:55,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 12:32:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:55,824 INFO L225 Difference]: With dead ends: 2042 [2020-11-09 12:32:55,825 INFO L226 Difference]: Without dead ends: 2042 [2020-11-09 12:32:55,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2020-11-09 12:32:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2020-11-09 12:32:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2020-11-09 12:32:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7736 transitions. [2020-11-09 12:32:56,007 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7736 transitions. Word has length 11 [2020-11-09 12:32:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:56,007 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7736 transitions. [2020-11-09 12:32:56,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:32:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7736 transitions. [2020-11-09 12:32:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:32:56,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:56,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:56,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:32:56,018 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:56,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2108909411, now seen corresponding path program 1 times [2020-11-09 12:32:56,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:56,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748569058] [2020-11-09 12:32:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:56,173 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-09 12:32:56,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748569058] [2020-11-09 12:32:56,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:56,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:32:56,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075865349] [2020-11-09 12:32:56,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:32:56,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:32:56,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:56,178 INFO L87 Difference]: Start difference. First operand 2042 states and 7736 transitions. Second operand 3 states. [2020-11-09 12:32:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:56,228 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-11-09 12:32:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:32:56,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 12:32:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:56,252 INFO L225 Difference]: With dead ends: 1962 [2020-11-09 12:32:56,252 INFO L226 Difference]: Without dead ends: 1962 [2020-11-09 12:32:56,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:32:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-11-09 12:32:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-11-09 12:32:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-11-09 12:32:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-11-09 12:32:56,344 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-11-09 12:32:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:56,345 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-11-09 12:32:56,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:32:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-11-09 12:32:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:32:56,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:56,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:56,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:32:56,348 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash 951680485, now seen corresponding path program 1 times [2020-11-09 12:32:56,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:56,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311492240] [2020-11-09 12:32:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:32:56,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311492240] [2020-11-09 12:32:56,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:56,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:32:56,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382737729] [2020-11-09 12:32:56,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:32:56,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:56,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:32:56,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:56,517 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-11-09 12:32:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:56,668 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-11-09 12:32:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:32:56,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 12:32:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:56,689 INFO L225 Difference]: With dead ends: 1898 [2020-11-09 12:32:56,689 INFO L226 Difference]: Without dead ends: 1898 [2020-11-09 12:32:56,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-11-09 12:32:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-11-09 12:32:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-11-09 12:32:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-11-09 12:32:56,776 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-11-09 12:32:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:56,777 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-11-09 12:32:56,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:32:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-11-09 12:32:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:32:56,780 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:56,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:56,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:32:56,781 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:56,782 INFO L82 PathProgramCache]: Analyzing trace with hash 343190440, now seen corresponding path program 1 times [2020-11-09 12:32:56,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:56,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011802843] [2020-11-09 12:32:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:32:56,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011802843] [2020-11-09 12:32:56,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:56,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:32:56,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799906107] [2020-11-09 12:32:56,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:32:56,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:32:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:56,996 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 6 states. [2020-11-09 12:32:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:57,204 INFO L93 Difference]: Finished difference Result 1866 states and 6960 transitions. [2020-11-09 12:32:57,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:32:57,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 12:32:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:57,223 INFO L225 Difference]: With dead ends: 1866 [2020-11-09 12:32:57,224 INFO L226 Difference]: Without dead ends: 1866 [2020-11-09 12:32:57,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:32:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2020-11-09 12:32:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2020-11-09 12:32:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1866 states. [2020-11-09 12:32:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6960 transitions. [2020-11-09 12:32:57,383 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 6960 transitions. Word has length 15 [2020-11-09 12:32:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:57,383 INFO L481 AbstractCegarLoop]: Abstraction has 1866 states and 6960 transitions. [2020-11-09 12:32:57,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:32:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 6960 transitions. [2020-11-09 12:32:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:32:57,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:57,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:57,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:32:57,389 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash -263159932, now seen corresponding path program 1 times [2020-11-09 12:32:57,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:57,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891119616] [2020-11-09 12:32:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:57,534 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-09 12:32:57,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891119616] [2020-11-09 12:32:57,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:57,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:32:57,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388029021] [2020-11-09 12:32:57,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:32:57,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:57,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:32:57,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:32:57,536 INFO L87 Difference]: Start difference. First operand 1866 states and 6960 transitions. Second operand 4 states. [2020-11-09 12:32:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:57,638 INFO L93 Difference]: Finished difference Result 1932 states and 6574 transitions. [2020-11-09 12:32:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:32:57,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 12:32:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:57,654 INFO L225 Difference]: With dead ends: 1932 [2020-11-09 12:32:57,654 INFO L226 Difference]: Without dead ends: 1452 [2020-11-09 12:32:57,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-11-09 12:32:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2020-11-09 12:32:57,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2020-11-09 12:32:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 4890 transitions. [2020-11-09 12:32:57,713 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 4890 transitions. Word has length 15 [2020-11-09 12:32:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:57,713 INFO L481 AbstractCegarLoop]: Abstraction has 1452 states and 4890 transitions. [2020-11-09 12:32:57,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:32:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 4890 transitions. [2020-11-09 12:32:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:32:57,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:57,717 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:57,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:32:57,718 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 454346801, now seen corresponding path program 1 times [2020-11-09 12:32:57,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:57,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528405393] [2020-11-09 12:32:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:57,874 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-09 12:32:57,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528405393] [2020-11-09 12:32:57,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:57,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:32:57,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353860407] [2020-11-09 12:32:57,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:32:57,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:32:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:57,877 INFO L87 Difference]: Start difference. First operand 1452 states and 4890 transitions. Second operand 5 states. [2020-11-09 12:32:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:57,989 INFO L93 Difference]: Finished difference Result 1251 states and 3871 transitions. [2020-11-09 12:32:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:32:57,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 12:32:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:57,999 INFO L225 Difference]: With dead ends: 1251 [2020-11-09 12:32:57,999 INFO L226 Difference]: Without dead ends: 951 [2020-11-09 12:32:57,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2020-11-09 12:32:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2020-11-09 12:32:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2020-11-09 12:32:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2886 transitions. [2020-11-09 12:32:58,032 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2886 transitions. Word has length 16 [2020-11-09 12:32:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:58,032 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 2886 transitions. [2020-11-09 12:32:58,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:32:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2886 transitions. [2020-11-09 12:32:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:32:58,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:58,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:58,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:32:58,036 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2006986927, now seen corresponding path program 1 times [2020-11-09 12:32:58,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:58,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162289959] [2020-11-09 12:32:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:58,184 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-09 12:32:58,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162289959] [2020-11-09 12:32:58,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:58,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:32:58,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234603904] [2020-11-09 12:32:58,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:32:58,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:58,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:32:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:58,187 INFO L87 Difference]: Start difference. First operand 951 states and 2886 transitions. Second operand 6 states. [2020-11-09 12:32:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:58,409 INFO L93 Difference]: Finished difference Result 1504 states and 4507 transitions. [2020-11-09 12:32:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:32:58,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 12:32:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:58,434 INFO L225 Difference]: With dead ends: 1504 [2020-11-09 12:32:58,435 INFO L226 Difference]: Without dead ends: 1132 [2020-11-09 12:32:58,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:32:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2020-11-09 12:32:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 951. [2020-11-09 12:32:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2020-11-09 12:32:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2806 transitions. [2020-11-09 12:32:58,470 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2806 transitions. Word has length 19 [2020-11-09 12:32:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:58,470 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 2806 transitions. [2020-11-09 12:32:58,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:32:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2806 transitions. [2020-11-09 12:32:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:32:58,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:58,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:58,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:32:58,473 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:58,474 INFO L82 PathProgramCache]: Analyzing trace with hash 262437935, now seen corresponding path program 1 times [2020-11-09 12:32:58,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:58,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509483852] [2020-11-09 12:32:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:58,593 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-09 12:32:58,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509483852] [2020-11-09 12:32:58,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:58,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:32:58,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787021269] [2020-11-09 12:32:58,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:32:58,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:32:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:58,596 INFO L87 Difference]: Start difference. First operand 951 states and 2806 transitions. Second operand 6 states. [2020-11-09 12:32:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:58,716 INFO L93 Difference]: Finished difference Result 827 states and 2409 transitions. [2020-11-09 12:32:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:32:58,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 12:32:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:58,722 INFO L225 Difference]: With dead ends: 827 [2020-11-09 12:32:58,722 INFO L226 Difference]: Without dead ends: 728 [2020-11-09 12:32:58,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:32:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-11-09 12:32:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2020-11-09 12:32:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-11-09 12:32:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2155 transitions. [2020-11-09 12:32:58,744 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2155 transitions. Word has length 19 [2020-11-09 12:32:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:58,744 INFO L481 AbstractCegarLoop]: Abstraction has 728 states and 2155 transitions. [2020-11-09 12:32:58,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:32:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2155 transitions. [2020-11-09 12:32:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:32:58,747 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:58,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:58,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:32:58,748 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 87479135, now seen corresponding path program 1 times [2020-11-09 12:32:58,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:58,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313952136] [2020-11-09 12:32:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:58,882 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-09 12:32:58,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313952136] [2020-11-09 12:32:58,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:58,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:32:58,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218428757] [2020-11-09 12:32:58,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:32:58,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:32:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:32:58,885 INFO L87 Difference]: Start difference. First operand 728 states and 2155 transitions. Second operand 6 states. [2020-11-09 12:32:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,048 INFO L93 Difference]: Finished difference Result 1257 states and 3580 transitions. [2020-11-09 12:32:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:32:59,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-11-09 12:32:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,054 INFO L225 Difference]: With dead ends: 1257 [2020-11-09 12:32:59,054 INFO L226 Difference]: Without dead ends: 773 [2020-11-09 12:32:59,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:32:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2020-11-09 12:32:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 647. [2020-11-09 12:32:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2020-11-09 12:32:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1739 transitions. [2020-11-09 12:32:59,077 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1739 transitions. Word has length 22 [2020-11-09 12:32:59,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,078 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 1739 transitions. [2020-11-09 12:32:59,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:32:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1739 transitions. [2020-11-09 12:32:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:32:59,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:32:59,080 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 123586923, now seen corresponding path program 2 times [2020-11-09 12:32:59,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172066390] [2020-11-09 12:32:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,207 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-09 12:32:59,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172066390] [2020-11-09 12:32:59,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:32:59,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437027547] [2020-11-09 12:32:59,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:32:59,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:32:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:32:59,210 INFO L87 Difference]: Start difference. First operand 647 states and 1739 transitions. Second operand 7 states. [2020-11-09 12:32:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,364 INFO L93 Difference]: Finished difference Result 620 states and 1685 transitions. [2020-11-09 12:32:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:32:59,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-11-09 12:32:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,368 INFO L225 Difference]: With dead ends: 620 [2020-11-09 12:32:59,368 INFO L226 Difference]: Without dead ends: 184 [2020-11-09 12:32:59,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:32:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-11-09 12:32:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-11-09 12:32:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-11-09 12:32:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2020-11-09 12:32:59,382 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 22 [2020-11-09 12:32:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,382 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2020-11-09 12:32:59,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:32:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2020-11-09 12:32:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-09 12:32:59,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,384 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:32:59,384 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1913086796, now seen corresponding path program 1 times [2020-11-09 12:32:59,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653420144] [2020-11-09 12:32:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:32:59,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653420144] [2020-11-09 12:32:59,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:32:59,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675005983] [2020-11-09 12:32:59,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:32:59,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:32:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:32:59,472 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 4 states. [2020-11-09 12:32:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,504 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2020-11-09 12:32:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:32:59,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-09 12:32:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,507 INFO L225 Difference]: With dead ends: 234 [2020-11-09 12:32:59,507 INFO L226 Difference]: Without dead ends: 92 [2020-11-09 12:32:59,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:32:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-09 12:32:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-09 12:32:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-09 12:32:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2020-11-09 12:32:59,511 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2020-11-09 12:32:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,511 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2020-11-09 12:32:59,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:32:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2020-11-09 12:32:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-09 12:32:59,512 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:32:59,512 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1384911540, now seen corresponding path program 2 times [2020-11-09 12:32:59,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813408890] [2020-11-09 12:32:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:32:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:32:59,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813408890] [2020-11-09 12:32:59,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:32:59,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:32:59,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186241365] [2020-11-09 12:32:59,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:32:59,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:32:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:32:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:32:59,707 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand 7 states. [2020-11-09 12:32:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:32:59,844 INFO L93 Difference]: Finished difference Result 118 states and 252 transitions. [2020-11-09 12:32:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:32:59,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-11-09 12:32:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:32:59,847 INFO L225 Difference]: With dead ends: 118 [2020-11-09 12:32:59,847 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 12:32:59,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:32:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 12:32:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-09 12:32:59,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-09 12:32:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-11-09 12:32:59,850 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-11-09 12:32:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:32:59,850 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-11-09 12:32:59,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:32:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-11-09 12:32:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-09 12:32:59,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:32:59,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:32:59,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:32:59,853 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:32:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:32:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1866539124, now seen corresponding path program 3 times [2020-11-09 12:32:59,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:32:59,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875568878] [2020-11-09 12:32:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:32:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:32:59,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:32:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:32:59,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:33:00,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:33:00,052 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:33:00,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:33:00,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:00 BasicIcfg [2020-11-09 12:33:00,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:33:00,232 INFO L168 Benchmark]: Toolchain (without parser) took 52849.83 ms. Allocated memory was 151.0 MB in the beginning and 323.0 MB in the end (delta: 172.0 MB). Free memory was 124.4 MB in the beginning and 118.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 179.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,233 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 101.5 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:33:00,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.26 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 121.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.03 ms. Allocated memory is still 151.0 MB. Free memory was 121.8 MB in the beginning and 118.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,238 INFO L168 Benchmark]: Boogie Preprocessor took 86.48 ms. Allocated memory is still 151.0 MB. Free memory was 118.8 MB in the beginning and 116.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,240 INFO L168 Benchmark]: RCFGBuilder took 2327.15 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.7 MB in the beginning and 103.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 65.7 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,241 INFO L168 Benchmark]: TraceAbstraction took 49544.16 ms. Allocated memory was 181.4 MB in the beginning and 323.0 MB in the end (delta: 141.6 MB). Free memory was 103.3 MB in the beginning and 118.0 MB in the end (delta: -14.7 MB). Peak memory consumption was 126.9 MB. Max. memory is 8.0 GB. [2020-11-09 12:33:00,249 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.20 ms. Allocated memory is still 125.8 MB. Free memory was 101.6 MB in the beginning and 101.5 MB in the end (delta: 68.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 758.26 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 121.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 28.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 120.03 ms. Allocated memory is still 151.0 MB. Free memory was 121.8 MB in the beginning and 118.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 86.48 ms. Allocated memory is still 151.0 MB. Free memory was 118.8 MB in the beginning and 116.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2327.15 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.7 MB in the beginning and 103.8 MB in the end (delta: 12.8 MB). Peak memory consumption was 65.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 49544.16 ms. Allocated memory was 181.4 MB in the beginning and 323.0 MB in the end (delta: 141.6 MB). Free memory was 103.3 MB in the beginning and 118.0 MB in the end (delta: -14.7 MB). Peak memory consumption was 126.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1897 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 65 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 43.5s, 132 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 6354 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1157; [L849] FCALL, FORK 0 pthread_create(&t1157, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1158; [L851] FCALL, FORK 0 pthread_create(&t1158, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1159; [L853] FCALL, FORK 0 pthread_create(&t1159, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1160; [L855] FCALL, FORK 0 pthread_create(&t1160, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix043_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 49.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 43.8s, HoareTripleCheckerStatistics: 453 SDtfs, 524 SDslu, 848 SDs, 0 SdLazy, 333 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 307 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 21599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...