/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:27:00,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:27:00,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:27:00,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:27:00,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:27:00,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:27:00,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:27:00,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:27:00,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:27:00,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:27:00,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:27:00,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:27:00,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:27:00,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:27:00,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:27:00,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:27:00,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:27:00,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:27:00,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:27:00,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:27:00,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:27:00,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:27:00,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:27:00,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:27:00,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:27:00,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:27:00,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:27:00,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:27:00,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:27:00,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:27:00,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:27:00,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:27:00,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:27:00,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:27:00,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:27:00,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:27:00,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:27:00,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:27:00,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:27:00,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:27:00,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:27:00,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:27:00,749 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:27:00,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:27:00,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:27:00,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:27:00,755 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:27:00,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:27:00,756 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:27:00,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:27:00,756 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:27:00,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:27:00,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:27:00,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:27:00,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:27:00,758 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:27:00,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:27:00,759 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:27:00,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:27:00,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:27:00,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:27:00,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:27:00,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:27:00,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:27:00,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:27:00,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:27:00,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:27:00,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:27:00,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:27:00,761 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:27:00,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:27:00,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:27:00,762 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 15:27:01,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:27:01,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:27:01,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:27:01,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:27:01,263 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:27:01,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2020-11-09 15:27:01,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee530a3bc/029ab3021be540d8b2bd64439021bf00/FLAG88f74b517 [2020-11-09 15:27:02,125 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:27:02,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_pso.opt.i [2020-11-09 15:27:02,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee530a3bc/029ab3021be540d8b2bd64439021bf00/FLAG88f74b517 [2020-11-09 15:27:02,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee530a3bc/029ab3021be540d8b2bd64439021bf00 [2020-11-09 15:27:02,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:27:02,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:27:02,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:27:02,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:27:02,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:27:02,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:27:02" (1/1) ... [2020-11-09 15:27:02,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d7e63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:02, skipping insertion in model container [2020-11-09 15:27:02,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:27:02" (1/1) ... [2020-11-09 15:27:02,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:27:02,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:27:03,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:27:03,070 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:27:03,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:27:03,300 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:27:03,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03 WrapperNode [2020-11-09 15:27:03,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:27:03,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:27:03,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:27:03,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:27:03,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:27:03,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:27:03,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:27:03,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:27:03,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (1/1) ... [2020-11-09 15:27:03,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:27:03,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:27:03,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:27:03,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:27:03,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (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 15:27:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:27:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:27:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:27:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:27:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:27:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:27:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:27:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:27:03,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:27:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:27:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:27:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:27:03,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:27:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:27:03,589 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 15:27:06,133 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:27:06,134 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:27:06,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:27:06 BoogieIcfgContainer [2020-11-09 15:27:06,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:27:06,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:27:06,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:27:06,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:27:06,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:27:02" (1/3) ... [2020-11-09 15:27:06,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630811f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:27:06, skipping insertion in model container [2020-11-09 15:27:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:03" (2/3) ... [2020-11-09 15:27:06,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630811f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:27:06, skipping insertion in model container [2020-11-09 15:27:06,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:27:06" (3/3) ... [2020-11-09 15:27:06,146 INFO L111 eAbstractionObserver]: Analyzing ICFG podwr001_pso.opt.i [2020-11-09 15:27:06,161 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:27:06,161 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:27:06,165 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:27:06,167 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:27:06,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,209 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,211 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,217 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,217 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,218 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,218 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,249 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,249 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,260 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:06,266 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:27:06,279 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 15:27:06,304 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:27:06,304 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:27:06,304 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:27:06,304 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:27:06,305 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:27:06,305 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:27:06,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:27:06,305 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:27:06,319 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:27:06,319 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 15:27:06,322 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-11-09 15:27:06,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-11-09 15:27:06,374 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-11-09 15:27:06,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:27:06,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-09 15:27:06,383 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-11-09 15:27:06,675 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 15:27:06,874 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 15:27:08,142 WARN L194 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:27:08,790 WARN L194 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 15:27:08,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:27:08,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:27:09,188 WARN L194 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 15:27:11,045 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:27:11,226 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-09 15:27:11,983 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:27:12,130 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:27:12,284 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:27:12,431 WARN L194 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:27:13,064 WARN L194 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 15:27:13,263 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 15:27:13,675 WARN L194 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-11-09 15:27:13,894 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-11-09 15:27:13,908 INFO L131 LiptonReduction]: Checked pairs total: 5118 [2020-11-09 15:27:13,908 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-11-09 15:27:13,918 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-09 15:27:14,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-11-09 15:27:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-11-09 15:27:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 15:27:14,012 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:14,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 15:27:14,015 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1099136, now seen corresponding path program 1 times [2020-11-09 15:27:14,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:14,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3808626] [2020-11-09 15:27:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:14,392 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 15:27:14,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3808626] [2020-11-09 15:27:14,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:14,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:27:14,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234551340] [2020-11-09 15:27:14,397 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:14,400 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:14,412 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-11-09 15:27:14,412 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:14,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:14,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:27:14,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:27:14,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:27:14,438 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-11-09 15:27:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:14,574 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-11-09 15:27:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:27:14,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 15:27:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:14,616 INFO L225 Difference]: With dead ends: 687 [2020-11-09 15:27:14,616 INFO L226 Difference]: Without dead ends: 562 [2020-11-09 15:27:14,618 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 15:27:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-11-09 15:27:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-11-09 15:27:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-09 15:27:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-11-09 15:27:14,760 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-11-09 15:27:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:14,760 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-11-09 15:27:14,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:27:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-11-09 15:27:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:27:14,762 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:14,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:14,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:27:14,763 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:14,764 INFO L82 PathProgramCache]: Analyzing trace with hash 452985326, now seen corresponding path program 1 times [2020-11-09 15:27:14,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:14,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345211432] [2020-11-09 15:27:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:14,860 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 15:27:14,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345211432] [2020-11-09 15:27:14,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:14,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:14,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101116919] [2020-11-09 15:27:14,861 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:14,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:14,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:27:14,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:14,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:14,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:14,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:14,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:14,868 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-11-09 15:27:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:14,954 INFO L93 Difference]: Finished difference Result 495 states and 1321 transitions. [2020-11-09 15:27:14,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:27:14,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-09 15:27:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:14,962 INFO L225 Difference]: With dead ends: 495 [2020-11-09 15:27:14,962 INFO L226 Difference]: Without dead ends: 370 [2020-11-09 15:27:14,966 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 15:27:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-11-09 15:27:14,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-11-09 15:27:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-11-09 15:27:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 957 transitions. [2020-11-09 15:27:14,995 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 957 transitions. Word has length 9 [2020-11-09 15:27:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:14,995 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 957 transitions. [2020-11-09 15:27:14,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 957 transitions. [2020-11-09 15:27:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:27:15,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:15,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:15,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:27:15,008 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash -889611962, now seen corresponding path program 1 times [2020-11-09 15:27:15,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:15,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787022502] [2020-11-09 15:27:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:15,227 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 15:27:15,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787022502] [2020-11-09 15:27:15,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:15,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:27:15,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952109192] [2020-11-09 15:27:15,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:15,230 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:15,233 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-11-09 15:27:15,234 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:15,293 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:15,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:15,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:15,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:15,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,368 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:15,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:15,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,424 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:15,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:27:15,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:27:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:27:15,425 INFO L87 Difference]: Start difference. First operand 370 states and 957 transitions. Second operand 5 states. [2020-11-09 15:27:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:15,480 INFO L93 Difference]: Finished difference Result 287 states and 681 transitions. [2020-11-09 15:27:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:27:15,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 15:27:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:15,483 INFO L225 Difference]: With dead ends: 287 [2020-11-09 15:27:15,483 INFO L226 Difference]: Without dead ends: 226 [2020-11-09 15:27:15,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:27:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-11-09 15:27:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2020-11-09 15:27:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-11-09 15:27:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 525 transitions. [2020-11-09 15:27:15,492 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 525 transitions. Word has length 13 [2020-11-09 15:27:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:15,493 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 525 transitions. [2020-11-09 15:27:15,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:27:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 525 transitions. [2020-11-09 15:27:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:27:15,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:15,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:27:15,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:27:15,495 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -701680187, now seen corresponding path program 1 times [2020-11-09 15:27:15,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:15,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141881447] [2020-11-09 15:27:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:15,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141881447] [2020-11-09 15:27:15,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:15,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:27:15,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902880490] [2020-11-09 15:27:15,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:15,752 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:15,763 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 41 transitions. [2020-11-09 15:27:15,764 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:15,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:15,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,792 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:15,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:15,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:27:15,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:27:15,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:15,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:15,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,015 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,017 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,221 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5568#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:27:16,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:27:16,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:27:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:27:16,223 INFO L87 Difference]: Start difference. First operand 226 states and 525 transitions. Second operand 7 states. [2020-11-09 15:27:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:16,284 INFO L93 Difference]: Finished difference Result 203 states and 477 transitions. [2020-11-09 15:27:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:16,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-09 15:27:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:16,286 INFO L225 Difference]: With dead ends: 203 [2020-11-09 15:27:16,286 INFO L226 Difference]: Without dead ends: 190 [2020-11-09 15:27:16,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:27:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-11-09 15:27:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2020-11-09 15:27:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-11-09 15:27:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 453 transitions. [2020-11-09 15:27:16,295 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 453 transitions. Word has length 17 [2020-11-09 15:27:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:16,295 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 453 transitions. [2020-11-09 15:27:16,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:27:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 453 transitions. [2020-11-09 15:27:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:27:16,297 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:16,297 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] [2020-11-09 15:27:16,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:27:16,297 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:16,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:16,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2064304371, now seen corresponding path program 1 times [2020-11-09 15:27:16,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:16,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804744309] [2020-11-09 15:27:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:16,411 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 15:27:16,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804744309] [2020-11-09 15:27:16,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:16,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:16,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [761092356] [2020-11-09 15:27:16,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:16,421 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:16,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 57 transitions. [2020-11-09 15:27:16,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:16,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,597 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,646 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:27:16,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:27:16,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:27:16,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,698 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,719 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:16,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:16,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:16,720 INFO L87 Difference]: Start difference. First operand 190 states and 453 transitions. Second operand 4 states. [2020-11-09 15:27:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:16,740 INFO L93 Difference]: Finished difference Result 276 states and 646 transitions. [2020-11-09 15:27:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:16,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-09 15:27:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:16,742 INFO L225 Difference]: With dead ends: 276 [2020-11-09 15:27:16,742 INFO L226 Difference]: Without dead ends: 134 [2020-11-09 15:27:16,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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 15:27:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-09 15:27:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-09 15:27:16,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-09 15:27:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 293 transitions. [2020-11-09 15:27:16,748 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 293 transitions. Word has length 21 [2020-11-09 15:27:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:16,748 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 293 transitions. [2020-11-09 15:27:16,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 293 transitions. [2020-11-09 15:27:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:27:16,749 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:16,750 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] [2020-11-09 15:27:16,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:27:16,750 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1110835827, now seen corresponding path program 2 times [2020-11-09 15:27:16,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:16,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441942102] [2020-11-09 15:27:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:16,836 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 15:27:16,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441942102] [2020-11-09 15:27:16,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:16,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:27:16,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [256417052] [2020-11-09 15:27:16,837 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:16,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:16,914 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 49 transitions. [2020-11-09 15:27:16,915 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:16,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,989 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:16,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,991 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:16,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:16,992 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:16,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,075 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,076 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,132 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:27:17,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:27:17,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:27:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:27:17,134 INFO L87 Difference]: Start difference. First operand 134 states and 293 transitions. Second operand 4 states. [2020-11-09 15:27:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:17,151 INFO L93 Difference]: Finished difference Result 172 states and 370 transitions. [2020-11-09 15:27:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:27:17,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-09 15:27:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:17,153 INFO L225 Difference]: With dead ends: 172 [2020-11-09 15:27:17,153 INFO L226 Difference]: Without dead ends: 102 [2020-11-09 15:27:17,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 15:27:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-09 15:27:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-09 15:27:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-09 15:27:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 213 transitions. [2020-11-09 15:27:17,158 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 213 transitions. Word has length 21 [2020-11-09 15:27:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:17,158 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 213 transitions. [2020-11-09 15:27:17,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:27:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 213 transitions. [2020-11-09 15:27:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:27:17,159 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:17,160 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] [2020-11-09 15:27:17,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:27:17,160 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash -640418189, now seen corresponding path program 3 times [2020-11-09 15:27:17,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:17,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540654203] [2020-11-09 15:27:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:27:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:27:17,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540654203] [2020-11-09 15:27:17,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:27:17,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:27:17,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1015147640] [2020-11-09 15:27:17,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:27:17,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:27:17,560 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 128 transitions. [2020-11-09 15:27:17,560 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:27:17,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:27:17,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:27:17,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:17,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,660 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,674 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,676 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[8, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:27:17,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,680 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:17,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:17,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:17,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:17,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:17,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,958 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:17,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:17,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:17,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:17,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,056 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,114 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:27:18,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:27:18,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,116 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,121 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,127 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,132 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,145 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[8, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:27:18,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,148 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1] term [2020-11-09 15:27:18,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,615 WARN L194 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2020-11-09 15:27:18,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,624 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,732 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,734 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,738 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,738 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,795 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:18,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:27:18,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:27:18,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:18,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:18,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:18,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:18,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:18,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:18,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:19,368 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2020-11-09 15:27:19,377 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:19,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:19,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:19,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,381 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:19,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,382 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:19,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:19,759 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 20 [2020-11-09 15:27:19,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:19,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,768 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:19,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:19,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:19,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:19,772 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:19,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:20,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:20,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:20,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:20,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:20,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:20,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:20,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:20,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,368 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:20,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:20,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:20,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:20,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:20,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:20,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:20,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:20,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,936 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:20,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,937 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:20,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:20,938 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:20,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:21,164 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:21,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:21,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:21,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:21,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:21,425 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:21,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,426 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:21,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,427 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,429 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:21,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:21,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:21,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,764 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:21,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,765 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:21,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:21,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:21,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:22,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 15:27:22,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 15:27:22,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:27:22,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,044 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:27:22,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:27:22,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 15:27:22,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:27:22,326 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [7095#(and (or (= ~z$w_buff0~0 ~z~0) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (not (= (mod ~z$w_buff0_used~0 256) 0))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 1) (= ~z$r_buff1_thd3~0 0) (or (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$w_buff0~0 ~z~0))), 7096#(and (not (= (mod ~z$w_buff0_used~0 256) 0)) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$r_buff0_thd1~0 256) 0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 1) (= ~z$r_buff1_thd3~0 0) (or (not (= (mod ~z$r_buff0_thd1~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0)))), 7097#(and (= ~z$r_buff1_thd2~0 0) (not (= (mod ~z$w_buff0_used~0 256) 0)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 1) (= ~z$r_buff1_thd3~0 0) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))] [2020-11-09 15:27:22,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 15:27:22,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:27:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 15:27:22,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:27:22,328 INFO L87 Difference]: Start difference. First operand 102 states and 213 transitions. Second operand 11 states. [2020-11-09 15:27:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:27:22,564 INFO L93 Difference]: Finished difference Result 122 states and 248 transitions. [2020-11-09 15:27:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:27:22,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-09 15:27:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:27:22,566 INFO L225 Difference]: With dead ends: 122 [2020-11-09 15:27:22,566 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 15:27:22,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 19 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:27:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 15:27:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-09 15:27:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-09 15:27:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-11-09 15:27:22,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2020-11-09 15:27:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:27:22,570 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-11-09 15:27:22,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 15:27:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-11-09 15:27:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 15:27:22,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:27:22,571 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] [2020-11-09 15:27:22,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:27:22,571 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:27:22,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:27:22,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1116555597, now seen corresponding path program 4 times [2020-11-09 15:27:22,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:27:22,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322073667] [2020-11-09 15:27:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:27:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:22,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:27:22,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:27:22,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:27:22,850 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:27:22,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:27:23,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:27:23 BasicIcfg [2020-11-09 15:27:23,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:27:23,009 INFO L168 Benchmark]: Toolchain (without parser) took 20619.51 ms. Allocated memory was 151.0 MB in the beginning and 408.9 MB in the end (delta: 257.9 MB). Free memory was 106.5 MB in the beginning and 240.5 MB in the end (delta: -134.0 MB). Peak memory consumption was 124.6 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,009 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:27:23,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 905.98 ms. Allocated memory is still 151.0 MB. Free memory was 105.9 MB in the beginning and 110.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 8.5 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,012 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.19 ms. Allocated memory is still 151.0 MB. Free memory was 110.6 MB in the beginning and 108.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,013 INFO L168 Benchmark]: Boogie Preprocessor took 80.40 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 105.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,016 INFO L168 Benchmark]: RCFGBuilder took 2645.83 ms. Allocated memory was 151.0 MB in the beginning and 190.8 MB in the end (delta: 39.8 MB). Free memory was 105.8 MB in the beginning and 115.8 MB in the end (delta: -10.0 MB). Peak memory consumption was 66.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,017 INFO L168 Benchmark]: TraceAbstraction took 16868.55 ms. Allocated memory was 190.8 MB in the beginning and 408.9 MB in the end (delta: 218.1 MB). Free memory was 115.3 MB in the beginning and 240.5 MB in the end (delta: -125.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 8.0 GB. [2020-11-09 15:27:23,027 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 124.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 905.98 ms. Allocated memory is still 151.0 MB. Free memory was 105.9 MB in the beginning and 110.6 MB in the end (delta: -4.7 MB). Peak memory consumption was 8.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 97.19 ms. Allocated memory is still 151.0 MB. Free memory was 110.6 MB in the beginning and 108.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.40 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 105.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2645.83 ms. Allocated memory was 151.0 MB in the beginning and 190.8 MB in the end (delta: 39.8 MB). Free memory was 105.8 MB in the beginning and 115.8 MB in the end (delta: -10.0 MB). Peak memory consumption was 66.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16868.55 ms. Allocated memory was 190.8 MB in the beginning and 408.9 MB in the end (delta: 218.1 MB). Free memory was 115.3 MB in the beginning and 240.5 MB in the end (delta: -125.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1040 VarBasedMoverChecksPositive, 37 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 81 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.5s, 110 PlacesBefore, 36 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 5118 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1570; [L836] FCALL, FORK 0 pthread_create(&t1570, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L837] 0 pthread_t t1571; [L838] FCALL, FORK 0 pthread_create(&t1571, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L839] 0 pthread_t t1572; [L840] FCALL, FORK 0 pthread_create(&t1572, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, 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_p2_EAX=0, arg={0:0}, arg={0: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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L794] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 3 z$flush_delayed = weak$$choice2 [L800] 3 z$mem_tmp = z [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L806] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 __unbuffered_p2_EAX = z [L809] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L809] 3 z = z$flush_delayed ? z$mem_tmp : z [L810] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 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) [L813] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L813] 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) [L813] 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) [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L814] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L815] 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 [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L816] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L817] 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 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L846] 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) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] 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) [L846] 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) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 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 [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 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 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "podwr001_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 197 SDtfs, 216 SDslu, 394 SDs, 0 SdLazy, 163 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 78 SyntacticMatches, 23 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 7892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...