/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:21:16,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:21:16,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:21:16,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:21:16,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:21:16,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:21:16,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:21:16,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:21:16,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:21:16,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:21:16,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:21:16,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:21:16,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:21:16,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:21:16,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:21:16,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:21:16,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:21:16,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:21:16,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:21:16,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:21:16,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:21:16,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:21:16,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:21:16,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:21:16,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:21:16,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:21:16,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:21:16,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:21:16,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:21:16,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:21:16,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:21:16,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:21:16,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:21:16,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:21:16,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:21:16,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:21:16,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:21:16,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:21:16,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:21:16,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:21:16,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:21:16,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:21:16,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:21:16,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:21:16,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:21:16,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:21:16,266 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:21:16,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:21:16,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:21:16,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:21:16,268 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:21:16,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:21:16,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:21:16,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:21:16,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:21:16,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:21:16,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:21:16,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:21:16,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:21:16,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:21:16,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:21:16,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:21:16,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:21:16,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:21:16,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:21:16,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:21:16,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:21:16,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:21:16,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:21:16,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:21:16,574 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:21:16,575 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:21:16,576 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.opt.i [2020-10-16 11:21:16,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1293431f5/4eaed1e466a5430b959d5a0174ec613c/FLAG1625d39da [2020-10-16 11:21:17,167 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:21:17,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe027_rmo.opt.i [2020-10-16 11:21:17,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1293431f5/4eaed1e466a5430b959d5a0174ec613c/FLAG1625d39da [2020-10-16 11:21:17,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1293431f5/4eaed1e466a5430b959d5a0174ec613c [2020-10-16 11:21:17,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:21:17,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:21:17,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:21:17,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:21:17,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:21:17,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:21:17" (1/1) ... [2020-10-16 11:21:17,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e94cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:17, skipping insertion in model container [2020-10-16 11:21:17,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:21:17" (1/1) ... [2020-10-16 11:21:17,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:21:17,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:21:18,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:21:18,124 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:21:18,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:21:18,347 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:21:18,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18 WrapperNode [2020-10-16 11:21:18,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:21:18,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:21:18,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:21:18,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:21:18,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:21:18,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:21:18,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:21:18,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:21:18,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... [2020-10-16 11:21:18,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:21:18,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:21:18,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:21:18,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:21:18,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:21:18,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 11:21:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:21:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:21:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:21:18,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:21:18,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:21:18,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:21:18,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:21:18,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:21:18,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:21:18,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:21:18,570 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 11:21:18,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 11:21:18,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 11:21:18,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:21:18,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:21:18,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:21:18,573 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:21:20,894 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:21:20,895 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 11:21:20,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:21:20 BoogieIcfgContainer [2020-10-16 11:21:20,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:21:20,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:21:20,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:21:20,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:21:20,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:21:17" (1/3) ... [2020-10-16 11:21:20,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76552fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:21:20, skipping insertion in model container [2020-10-16 11:21:20,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:21:18" (2/3) ... [2020-10-16 11:21:20,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76552fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:21:20, skipping insertion in model container [2020-10-16 11:21:20,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:21:20" (3/3) ... [2020-10-16 11:21:20,909 INFO L111 eAbstractionObserver]: Analyzing ICFG safe027_rmo.opt.i [2020-10-16 11:21:20,921 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:21:20,921 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:21:20,931 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 11:21:20,932 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:21:20,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:20,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,015 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,015 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,018 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,023 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,024 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,027 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,039 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:21:21,045 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:21:21,060 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 11:21:21,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:21:21,082 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:21:21,082 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:21:21,082 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:21:21,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:21:21,082 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:21:21,082 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:21:21,083 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:21:21,103 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:21:21,107 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 268 flow [2020-10-16 11:21:21,110 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 268 flow [2020-10-16 11:21:21,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2020-10-16 11:21:21,190 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2020-10-16 11:21:21,191 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:21:21,197 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-10-16 11:21:21,203 INFO L117 LiptonReduction]: Number of co-enabled transitions 1956 [2020-10-16 11:21:21,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:21,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:21,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:21,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:21,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:21,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:21,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:21,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:21,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:21,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:21,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:21,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:21,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:21,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:21,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:21,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:21,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:21,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:21,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:22,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:22,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:22,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:22,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:22,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:22,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:22,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:22,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:22,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:22,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:22,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:22,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:22,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:22,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:22,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:22,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:22,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:22,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:22,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:22,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:22,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:22,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,898 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-16 11:21:22,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:22,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:22,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:22,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,013 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 11:21:23,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:23,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:23,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:23,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:23,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:23,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:23,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:23,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:23,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:23,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:23,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:24,536 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-16 11:21:24,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:24,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,109 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 11:21:25,539 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 11:21:25,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:25,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:25,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:25,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:25,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:25,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:25,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:25,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:25,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:25,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:25,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:25,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:21:25,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:21:25,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:25,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:21:25,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:25,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:25,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:25,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:25,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:26,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 11:21:26,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:26,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:26,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:26,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:26,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:26,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 11:21:26,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:21:26,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:21:26,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:26,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:26,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:26,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:26,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:26,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:21:26,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:26,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:26,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:21:26,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:26,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:26,804 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-16 11:21:26,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:21:27,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:21:27,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:27,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:27,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:27,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:21:27,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:21:27,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-16 11:21:27,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:27,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:21:27,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:21:28,204 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-16 11:21:28,587 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 11:21:28,709 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 11:21:29,389 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 144 [2020-10-16 11:21:29,701 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-16 11:21:29,727 INFO L132 LiptonReduction]: Checked pairs total: 4837 [2020-10-16 11:21:29,727 INFO L134 LiptonReduction]: Total number of compositions: 108 [2020-10-16 11:21:29,752 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 28 transitions, 76 flow [2020-10-16 11:21:29,882 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1090 states. [2020-10-16 11:21:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states. [2020-10-16 11:21:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:21:29,901 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:29,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:29,902 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1727210212, now seen corresponding path program 1 times [2020-10-16 11:21:29,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:29,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164556004] [2020-10-16 11:21:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:30,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164556004] [2020-10-16 11:21:30,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:30,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:21:30,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957778346] [2020-10-16 11:21:30,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:21:30,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:21:30,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:30,405 INFO L87 Difference]: Start difference. First operand 1090 states. Second operand 3 states. [2020-10-16 11:21:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:30,473 INFO L93 Difference]: Finished difference Result 1042 states and 3746 transitions. [2020-10-16 11:21:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:21:30,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 11:21:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:30,501 INFO L225 Difference]: With dead ends: 1042 [2020-10-16 11:21:30,501 INFO L226 Difference]: Without dead ends: 850 [2020-10-16 11:21:30,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2020-10-16 11:21:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2020-10-16 11:21:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2020-10-16 11:21:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2994 transitions. [2020-10-16 11:21:30,624 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 2994 transitions. Word has length 11 [2020-10-16 11:21:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:30,631 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 2994 transitions. [2020-10-16 11:21:30,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:21:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 2994 transitions. [2020-10-16 11:21:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:21:30,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:30,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:30,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:21:30,638 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:30,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1036472285, now seen corresponding path program 1 times [2020-10-16 11:21:30,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:30,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058867515] [2020-10-16 11:21:30,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:30,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058867515] [2020-10-16 11:21:30,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:30,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:21:30,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346069140] [2020-10-16 11:21:30,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:21:30,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:21:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:21:30,740 INFO L87 Difference]: Start difference. First operand 850 states and 2994 transitions. Second operand 4 states. [2020-10-16 11:21:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:30,779 INFO L93 Difference]: Finished difference Result 1138 states and 3894 transitions. [2020-10-16 11:21:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:21:30,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:21:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:30,785 INFO L225 Difference]: With dead ends: 1138 [2020-10-16 11:21:30,785 INFO L226 Difference]: Without dead ends: 634 [2020-10-16 11:21:30,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2020-10-16 11:21:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2020-10-16 11:21:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2020-10-16 11:21:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2104 transitions. [2020-10-16 11:21:30,807 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 2104 transitions. Word has length 12 [2020-10-16 11:21:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:30,808 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 2104 transitions. [2020-10-16 11:21:30,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:21:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 2104 transitions. [2020-10-16 11:21:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:21:30,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:30,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:30,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:21:30,810 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1113819785, now seen corresponding path program 1 times [2020-10-16 11:21:30,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:30,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128634066] [2020-10-16 11:21:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:30,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128634066] [2020-10-16 11:21:30,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:30,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:21:30,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825014848] [2020-10-16 11:21:30,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:21:30,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:21:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:30,945 INFO L87 Difference]: Start difference. First operand 634 states and 2104 transitions. Second operand 3 states. [2020-10-16 11:21:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:30,963 INFO L93 Difference]: Finished difference Result 610 states and 2010 transitions. [2020-10-16 11:21:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:21:30,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 11:21:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:30,969 INFO L225 Difference]: With dead ends: 610 [2020-10-16 11:21:30,969 INFO L226 Difference]: Without dead ends: 610 [2020-10-16 11:21:30,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:21:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-10-16 11:21:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-10-16 11:21:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-10-16 11:21:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 2010 transitions. [2020-10-16 11:21:30,988 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 2010 transitions. Word has length 13 [2020-10-16 11:21:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:30,988 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 2010 transitions. [2020-10-16 11:21:30,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:21:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 2010 transitions. [2020-10-16 11:21:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:21:30,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:30,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:30,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:21:30,990 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash 266544411, now seen corresponding path program 1 times [2020-10-16 11:21:30,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:30,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147266903] [2020-10-16 11:21:30,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:31,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147266903] [2020-10-16 11:21:31,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:31,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:31,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967819261] [2020-10-16 11:21:31,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:21:31,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:21:31,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:31,338 INFO L87 Difference]: Start difference. First operand 610 states and 2010 transitions. Second operand 8 states. [2020-10-16 11:21:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:31,546 INFO L93 Difference]: Finished difference Result 604 states and 1985 transitions. [2020-10-16 11:21:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:21:31,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-16 11:21:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:31,553 INFO L225 Difference]: With dead ends: 604 [2020-10-16 11:21:31,553 INFO L226 Difference]: Without dead ends: 604 [2020-10-16 11:21:31,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:21:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-16 11:21:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-16 11:21:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-16 11:21:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1985 transitions. [2020-10-16 11:21:31,580 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1985 transitions. Word has length 14 [2020-10-16 11:21:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:31,580 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1985 transitions. [2020-10-16 11:21:31,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:21:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1985 transitions. [2020-10-16 11:21:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:21:31,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:31,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:31,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:21:31,584 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:31,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1683531764, now seen corresponding path program 1 times [2020-10-16 11:21:31,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:31,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116433019] [2020-10-16 11:21:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:31,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116433019] [2020-10-16 11:21:31,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:31,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:31,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777585893] [2020-10-16 11:21:31,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:31,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:31,876 INFO L87 Difference]: Start difference. First operand 604 states and 1985 transitions. Second operand 7 states. [2020-10-16 11:21:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:32,125 INFO L93 Difference]: Finished difference Result 1321 states and 4236 transitions. [2020-10-16 11:21:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:21:32,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:21:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:32,136 INFO L225 Difference]: With dead ends: 1321 [2020-10-16 11:21:32,136 INFO L226 Difference]: Without dead ends: 1249 [2020-10-16 11:21:32,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-10-16 11:21:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 919. [2020-10-16 11:21:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2020-10-16 11:21:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 3011 transitions. [2020-10-16 11:21:32,178 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 3011 transitions. Word has length 15 [2020-10-16 11:21:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:32,178 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 3011 transitions. [2020-10-16 11:21:32,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 3011 transitions. [2020-10-16 11:21:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:21:32,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:32,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:32,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:21:32,182 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:32,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash -327059792, now seen corresponding path program 2 times [2020-10-16 11:21:32,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:32,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734752973] [2020-10-16 11:21:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:32,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734752973] [2020-10-16 11:21:32,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:32,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:32,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70532724] [2020-10-16 11:21:32,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:32,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:32,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:32,621 INFO L87 Difference]: Start difference. First operand 919 states and 3011 transitions. Second operand 7 states. [2020-10-16 11:21:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:32,941 INFO L93 Difference]: Finished difference Result 1339 states and 4239 transitions. [2020-10-16 11:21:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:21:32,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 11:21:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:32,952 INFO L225 Difference]: With dead ends: 1339 [2020-10-16 11:21:32,952 INFO L226 Difference]: Without dead ends: 1195 [2020-10-16 11:21:32,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-10-16 11:21:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-10-16 11:21:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-10-16 11:21:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2485 transitions. [2020-10-16 11:21:32,992 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2485 transitions. Word has length 15 [2020-10-16 11:21:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:32,992 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 2485 transitions. [2020-10-16 11:21:32,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2485 transitions. [2020-10-16 11:21:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:21:32,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:32,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:32,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:21:32,995 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:32,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash -327057808, now seen corresponding path program 1 times [2020-10-16 11:21:32,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:32,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482010894] [2020-10-16 11:21:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:33,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482010894] [2020-10-16 11:21:33,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:33,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:21:33,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052358875] [2020-10-16 11:21:33,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:21:33,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:21:33,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:21:33,102 INFO L87 Difference]: Start difference. First operand 778 states and 2485 transitions. Second operand 4 states. [2020-10-16 11:21:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:33,140 INFO L93 Difference]: Finished difference Result 866 states and 2550 transitions. [2020-10-16 11:21:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:21:33,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:21:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:33,145 INFO L225 Difference]: With dead ends: 866 [2020-10-16 11:21:33,145 INFO L226 Difference]: Without dead ends: 680 [2020-10-16 11:21:33,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2020-10-16 11:21:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2020-10-16 11:21:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-10-16 11:21:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 2023 transitions. [2020-10-16 11:21:33,165 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 2023 transitions. Word has length 15 [2020-10-16 11:21:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:33,165 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 2023 transitions. [2020-10-16 11:21:33,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:21:33,166 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 2023 transitions. [2020-10-16 11:21:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:21:33,167 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:33,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:33,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:21:33,168 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1764221078, now seen corresponding path program 1 times [2020-10-16 11:21:33,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:33,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371840512] [2020-10-16 11:21:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:33,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371840512] [2020-10-16 11:21:33,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:33,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:21:33,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379915203] [2020-10-16 11:21:33,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:21:33,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:21:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:21:33,246 INFO L87 Difference]: Start difference. First operand 680 states and 2023 transitions. Second operand 5 states. [2020-10-16 11:21:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:33,294 INFO L93 Difference]: Finished difference Result 641 states and 1728 transitions. [2020-10-16 11:21:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:21:33,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:21:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:33,298 INFO L225 Difference]: With dead ends: 641 [2020-10-16 11:21:33,298 INFO L226 Difference]: Without dead ends: 499 [2020-10-16 11:21:33,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:21:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2020-10-16 11:21:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2020-10-16 11:21:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2020-10-16 11:21:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1328 transitions. [2020-10-16 11:21:33,311 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1328 transitions. Word has length 16 [2020-10-16 11:21:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:33,311 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 1328 transitions. [2020-10-16 11:21:33,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:21:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1328 transitions. [2020-10-16 11:21:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:21:33,313 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:33,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:33,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:21:33,313 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1035207769, now seen corresponding path program 1 times [2020-10-16 11:21:33,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:33,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462613754] [2020-10-16 11:21:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:33,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462613754] [2020-10-16 11:21:33,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:33,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:33,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886385705] [2020-10-16 11:21:33,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:33,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:33,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:33,557 INFO L87 Difference]: Start difference. First operand 499 states and 1328 transitions. Second operand 7 states. [2020-10-16 11:21:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:33,984 INFO L93 Difference]: Finished difference Result 846 states and 2211 transitions. [2020-10-16 11:21:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:33,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 11:21:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:33,989 INFO L225 Difference]: With dead ends: 846 [2020-10-16 11:21:33,990 INFO L226 Difference]: Without dead ends: 700 [2020-10-16 11:21:33,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:21:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-10-16 11:21:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 515. [2020-10-16 11:21:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-16 11:21:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1364 transitions. [2020-10-16 11:21:34,007 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1364 transitions. Word has length 17 [2020-10-16 11:21:34,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:34,007 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 1364 transitions. [2020-10-16 11:21:34,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1364 transitions. [2020-10-16 11:21:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:21:34,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:34,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:34,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:21:34,009 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1063053225, now seen corresponding path program 2 times [2020-10-16 11:21:34,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:34,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766493751] [2020-10-16 11:21:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:34,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766493751] [2020-10-16 11:21:34,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:34,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:34,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810000050] [2020-10-16 11:21:34,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:34,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:34,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:34,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:34,364 INFO L87 Difference]: Start difference. First operand 515 states and 1364 transitions. Second operand 7 states. [2020-10-16 11:21:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:34,629 INFO L93 Difference]: Finished difference Result 700 states and 1841 transitions. [2020-10-16 11:21:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:34,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 11:21:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:34,634 INFO L225 Difference]: With dead ends: 700 [2020-10-16 11:21:34,634 INFO L226 Difference]: Without dead ends: 700 [2020-10-16 11:21:34,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:21:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-10-16 11:21:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 505. [2020-10-16 11:21:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2020-10-16 11:21:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1334 transitions. [2020-10-16 11:21:34,647 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1334 transitions. Word has length 17 [2020-10-16 11:21:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:34,648 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 1334 transitions. [2020-10-16 11:21:34,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:34,648 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1334 transitions. [2020-10-16 11:21:34,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:21:34,649 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:34,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:34,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:21:34,650 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash -241805499, now seen corresponding path program 3 times [2020-10-16 11:21:34,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:34,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829477828] [2020-10-16 11:21:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829477828] [2020-10-16 11:21:34,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:34,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:34,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175142096] [2020-10-16 11:21:34,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:21:34,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:21:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:34,886 INFO L87 Difference]: Start difference. First operand 505 states and 1334 transitions. Second operand 8 states. [2020-10-16 11:21:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:35,382 INFO L93 Difference]: Finished difference Result 868 states and 2281 transitions. [2020-10-16 11:21:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:35,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-16 11:21:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:35,389 INFO L225 Difference]: With dead ends: 868 [2020-10-16 11:21:35,389 INFO L226 Difference]: Without dead ends: 868 [2020-10-16 11:21:35,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:21:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-10-16 11:21:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 517. [2020-10-16 11:21:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-16 11:21:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1360 transitions. [2020-10-16 11:21:35,412 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1360 transitions. Word has length 17 [2020-10-16 11:21:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:35,412 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1360 transitions. [2020-10-16 11:21:35,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:21:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1360 transitions. [2020-10-16 11:21:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:21:35,415 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:35,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:35,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:21:35,415 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash -86001013, now seen corresponding path program 4 times [2020-10-16 11:21:35,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:35,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188725986] [2020-10-16 11:21:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:35,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188725986] [2020-10-16 11:21:35,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:35,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:35,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616921631] [2020-10-16 11:21:35,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:35,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:35,735 INFO L87 Difference]: Start difference. First operand 517 states and 1360 transitions. Second operand 7 states. [2020-10-16 11:21:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:36,001 INFO L93 Difference]: Finished difference Result 781 states and 2071 transitions. [2020-10-16 11:21:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:36,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 11:21:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:36,007 INFO L225 Difference]: With dead ends: 781 [2020-10-16 11:21:36,007 INFO L226 Difference]: Without dead ends: 727 [2020-10-16 11:21:36,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:21:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2020-10-16 11:21:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 519. [2020-10-16 11:21:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2020-10-16 11:21:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1377 transitions. [2020-10-16 11:21:36,021 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1377 transitions. Word has length 17 [2020-10-16 11:21:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:36,022 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 1377 transitions. [2020-10-16 11:21:36,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1377 transitions. [2020-10-16 11:21:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:21:36,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:36,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:36,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:21:36,024 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash 681380094, now seen corresponding path program 1 times [2020-10-16 11:21:36,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:36,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861585530] [2020-10-16 11:21:36,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:36,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861585530] [2020-10-16 11:21:36,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:36,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:21:36,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78506224] [2020-10-16 11:21:36,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:21:36,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:21:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:21:36,103 INFO L87 Difference]: Start difference. First operand 519 states and 1377 transitions. Second operand 6 states. [2020-10-16 11:21:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:36,177 INFO L93 Difference]: Finished difference Result 463 states and 1186 transitions. [2020-10-16 11:21:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:21:36,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:21:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:36,180 INFO L225 Difference]: With dead ends: 463 [2020-10-16 11:21:36,181 INFO L226 Difference]: Without dead ends: 399 [2020-10-16 11:21:36,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2020-10-16 11:21:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2020-10-16 11:21:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2020-10-16 11:21:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 1032 transitions. [2020-10-16 11:21:36,195 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 1032 transitions. Word has length 18 [2020-10-16 11:21:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:36,196 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 1032 transitions. [2020-10-16 11:21:36,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:21:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1032 transitions. [2020-10-16 11:21:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:21:36,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:36,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:36,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:21:36,198 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:36,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1597123246, now seen corresponding path program 1 times [2020-10-16 11:21:36,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:36,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252304435] [2020-10-16 11:21:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:21:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:21:36,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252304435] [2020-10-16 11:21:36,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:21:36,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:21:36,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3735972] [2020-10-16 11:21:36,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:21:36,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:21:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:21:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:21:36,339 INFO L87 Difference]: Start difference. First operand 399 states and 1032 transitions. Second operand 7 states. [2020-10-16 11:21:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:21:36,409 INFO L93 Difference]: Finished difference Result 381 states and 994 transitions. [2020-10-16 11:21:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:21:36,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-16 11:21:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:21:36,412 INFO L225 Difference]: With dead ends: 381 [2020-10-16 11:21:36,412 INFO L226 Difference]: Without dead ends: 313 [2020-10-16 11:21:36,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:21:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-16 11:21:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2020-10-16 11:21:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2020-10-16 11:21:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 821 transitions. [2020-10-16 11:21:36,420 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 821 transitions. Word has length 20 [2020-10-16 11:21:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:21:36,421 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 821 transitions. [2020-10-16 11:21:36,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:21:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 821 transitions. [2020-10-16 11:21:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:21:36,423 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:21:36,423 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:21:36,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:21:36,423 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:21:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:21:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash 706484492, now seen corresponding path program 1 times [2020-10-16 11:21:36,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:21:36,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214604963] [2020-10-16 11:21:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:21:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:21:36,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:21:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:21:36,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:21:36,626 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:21:36,626 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:21:36,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:21:36,628 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 11:21:36,658 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L3-->L870: Formula: (let ((.cse8 (= (mod ~y$r_buff1_thd0~0_In-1637026250 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-1637026250 256) 0)) (.cse10 (= (mod ~y$w_buff0_used~0_In-1637026250 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-1637026250 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse10)) (.cse2 (or .cse9 .cse10)) (.cse5 (or .cse8 .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse7))) (and (or (and (= ~y$w_buff0_used~0_Out-1637026250 0) .cse0 .cse1) (and (= ~y$w_buff0_used~0_In-1637026250 ~y$w_buff0_used~0_Out-1637026250) .cse2)) (or (and .cse3 (= ~y$w_buff1_used~0_Out-1637026250 0) .cse4) (and .cse5 (= ~y$w_buff1_used~0_In-1637026250 ~y$w_buff1_used~0_Out-1637026250))) (= ~y$r_buff1_thd0~0_Out-1637026250 ~y$r_buff1_thd0~0_In-1637026250) (let ((.cse6 (select |#memory_int_In-1637026250| |~#y~0.base_In-1637026250|))) (or (and .cse0 (= |#memory_int_Out-1637026250| (store |#memory_int_In-1637026250| |~#y~0.base_In-1637026250| (store .cse6 |~#y~0.offset_In-1637026250| ~y$w_buff0~0_In-1637026250))) .cse1) (and .cse2 (or (and .cse5 (= |#memory_int_Out-1637026250| (store |#memory_int_In-1637026250| |~#y~0.base_In-1637026250| (store .cse6 |~#y~0.offset_In-1637026250| (select .cse6 |~#y~0.offset_In-1637026250|))))) (and .cse3 (= |#memory_int_Out-1637026250| (store |#memory_int_In-1637026250| |~#y~0.base_In-1637026250| (store .cse6 |~#y~0.offset_In-1637026250| ~y$w_buff1~0_In-1637026250))) .cse4))))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1637026250| ULTIMATE.start_assume_abort_if_not_~cond_Out-1637026250) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1637026250 0)) (= ~y$r_buff0_thd0~0_Out-1637026250 ~y$r_buff0_thd0~0_In-1637026250)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1637026250|, ~#y~0.offset=|~#y~0.offset_In-1637026250|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1637026250, ~y$w_buff1~0=~y$w_buff1~0_In-1637026250, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1637026250, ~y$w_buff0~0=~y$w_buff0~0_In-1637026250, #memory_int=|#memory_int_In-1637026250|, ~#y~0.base=|~#y~0.base_In-1637026250|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1637026250, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1637026250} OutVars{ULTIMATE.start_main_#t~mem67=|ULTIMATE.start_main_#t~mem67_Out-1637026250|, ~#y~0.offset=|~#y~0.offset_In-1637026250|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1637026250, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1637026250|, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1637026250|, ~#y~0.base=|~#y~0.base_In-1637026250|, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-1637026250|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1637026250|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1637026250|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1637026250|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1637026250, ~y$w_buff1~0=~y$w_buff1~0_In-1637026250, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1637026250|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1637026250, ~y$w_buff0~0=~y$w_buff0~0_In-1637026250, #memory_int=|#memory_int_Out-1637026250|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1637026250, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1637026250} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem67, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 11:21:36,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,679 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,679 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,680 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,680 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,681 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,682 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,689 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,690 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,690 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,691 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,692 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,693 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,694 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,694 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,695 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,696 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:21:36,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:21:36,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:21:36 BasicIcfg [2020-10-16 11:21:36,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:21:36,834 INFO L168 Benchmark]: Toolchain (without parser) took 19355.22 ms. Allocated memory was 146.8 MB in the beginning and 528.0 MB in the end (delta: 381.2 MB). Free memory was 100.1 MB in the beginning and 471.8 MB in the end (delta: -371.6 MB). Peak memory consumption was 402.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,835 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.07 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.99 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,836 INFO L168 Benchmark]: Boogie Preprocessor took 44.56 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,837 INFO L168 Benchmark]: RCFGBuilder took 2415.19 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 148.4 MB in the beginning and 194.0 MB in the end (delta: -45.6 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,838 INFO L168 Benchmark]: TraceAbstraction took 15932.73 ms. Allocated memory was 246.9 MB in the beginning and 528.0 MB in the end (delta: 281.0 MB). Free memory was 194.0 MB in the beginning and 471.8 MB in the end (delta: -277.7 MB). Peak memory consumption was 396.0 MB. Max. memory is 7.1 GB. [2020-10-16 11:21:36,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.07 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 153.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.99 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.56 ms. Allocated memory is still 203.4 MB. Free memory was 151.1 MB in the beginning and 148.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2415.19 ms. Allocated memory was 203.4 MB in the beginning and 246.9 MB in the end (delta: 43.5 MB). Free memory was 148.4 MB in the beginning and 194.0 MB in the end (delta: -45.6 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15932.73 ms. Allocated memory was 246.9 MB in the beginning and 528.0 MB in the end (delta: 281.0 MB). Free memory was 194.0 MB in the beginning and 471.8 MB in the end (delta: -277.7 MB). Peak memory consumption was 396.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1355 VarBasedMoverChecksPositive, 77 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 135 PlacesBefore, 40 PlacesAfterwards, 124 TransitionsBefore, 28 TransitionsAfterwards, 1956 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 4837 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L703] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L704] 0 int __unbuffered_p0_EAX$mem_tmp; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L712] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L713] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L715] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L716] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L717] 0 int __unbuffered_p0_EAX$w_buff0; [L718] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L719] 0 int __unbuffered_p0_EAX$w_buff1; [L720] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L722] 0 int __unbuffered_p0_EBX = 0; [L724] 0 int __unbuffered_p2_EAX = 0; [L726] 0 int __unbuffered_p2_EBX = 0; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L732] 0 int y = 0; [L733] 0 _Bool y$flush_delayed; [L734] 0 int y$mem_tmp; [L735] 0 _Bool y$r_buff0_thd0; [L736] 0 _Bool y$r_buff0_thd1; [L737] 0 _Bool y$r_buff0_thd2; [L738] 0 _Bool y$r_buff0_thd3; [L739] 0 _Bool y$r_buff0_thd4; [L740] 0 _Bool y$r_buff1_thd0; [L741] 0 _Bool y$r_buff1_thd1; [L742] 0 _Bool y$r_buff1_thd2; [L743] 0 _Bool y$r_buff1_thd3; [L744] 0 _Bool y$r_buff1_thd4; [L745] 0 _Bool y$read_delayed; [L746] 0 int *y$read_delayed_var; [L747] 0 int y$w_buff0; [L748] 0 _Bool y$w_buff0_used; [L749] 0 int y$w_buff1; [L750] 0 _Bool y$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice1; [L753] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2437; [L853] FCALL, FORK 0 pthread_create(&t2437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2438; [L855] FCALL, FORK 0 pthread_create(&t2438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2439; [L757] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L758] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L759] 1 y$flush_delayed = weak$$choice2 [L760] EXPR 1 \read(y) [L760] 1 y$mem_tmp = y [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L762] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L763] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L763] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L764] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L766] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L767] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L767] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L769] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L770] EXPR 1 \read(y) [L770] 1 __unbuffered_p0_EAX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L787] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L857] FCALL, FORK 0 pthread_create(&t2439, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] EXPR 3 \read(y) [L805] 3 y$mem_tmp = y [L806] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L806] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L807] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L807] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L808] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1 [L808] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L808] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L809] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L811] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 \read(y) [L813] 3 __unbuffered_p2_EBX = y [L814] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L858] 0 pthread_t t2440; [L859] FCALL, FORK 0 pthread_create(&t2440, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 4 y = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L873] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L873] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L874] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 374 SDtfs, 501 SDslu, 833 SDs, 0 SdLazy, 745 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1090occurred 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.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1686 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 53906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...