/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:17:16,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:17:16,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:17:16,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:17:16,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:17:16,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:17:16,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:17:16,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:17:16,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:17:16,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:17:16,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:17:16,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:17:16,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:17:16,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:17:16,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:17:16,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:17:16,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:17:16,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:17:16,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:17:16,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:17:16,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:17:16,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:17:16,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:17:16,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:17:16,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:17:16,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:17:16,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:17:16,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:17:16,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:17:16,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:17:16,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:17:16,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:17:16,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:17:16,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:17:16,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:17:16,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:17:16,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:17:16,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:17:16,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:17:16,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:17:16,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:17:16,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:17:16,576 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:17:16,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:17:16,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:17:16,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:17:16,578 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:17:16,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:17:16,578 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:17:16,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:17:16,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:17:16,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:17:16,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:17:16,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:17:16,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:17:16,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:17:16,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:17:16,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:17:16,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:17:16,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:17:16,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:17:16,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:17:16,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:17:16,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:17:16,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:17:16,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:17:16,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:17:16,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:17:16,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:17:16,917 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:17:16,917 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:17:16,918 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_rmo.opt.i [2020-10-16 01:17:16,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84bbd84d/2a43c487d0bb44d2bc5b3baf3e66df92/FLAG9c1391f58 [2020-10-16 01:17:17,543 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:17:17,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_rmo.opt.i [2020-10-16 01:17:17,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84bbd84d/2a43c487d0bb44d2bc5b3baf3e66df92/FLAG9c1391f58 [2020-10-16 01:17:17,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e84bbd84d/2a43c487d0bb44d2bc5b3baf3e66df92 [2020-10-16 01:17:17,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:17:17,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:17:17,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:17:17,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:17:17,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:17:17,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:17:17" (1/1) ... [2020-10-16 01:17:17,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7806e64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:17, skipping insertion in model container [2020-10-16 01:17:17,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:17:17" (1/1) ... [2020-10-16 01:17:17,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:17:17,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:17:18,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:17:18,501 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:17:18,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:17:18,699 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:17:18,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18 WrapperNode [2020-10-16 01:17:18,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:17:18,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:17:18,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:17:18,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:17:18,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:17:18,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:17:18,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:17:18,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:17:18,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... [2020-10-16 01:17:18,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:17:18,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:17:18,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:17:18,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:17:18,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:17:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:17:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:17:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:17:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:17:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:17:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:17:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:17:18,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:17:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:17:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:17:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:17:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:17:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:17:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:17:18,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:17:18,898 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 01:17:21,310 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:17:21,311 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:17:21,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:17:21 BoogieIcfgContainer [2020-10-16 01:17:21,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:17:21,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:17:21,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:17:21,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:17:21,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:17:17" (1/3) ... [2020-10-16 01:17:21,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:17:21, skipping insertion in model container [2020-10-16 01:17:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:18" (2/3) ... [2020-10-16 01:17:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:17:21, skipping insertion in model container [2020-10-16 01:17:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:17:21" (3/3) ... [2020-10-16 01:17:21,324 INFO L111 eAbstractionObserver]: Analyzing ICFG mix014_rmo.opt.i [2020-10-16 01:17:21,336 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:17:21,345 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:17:21,346 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:17:21,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,381 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,381 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,382 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,387 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,388 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,393 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,394 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,396 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,400 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,402 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,403 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,411 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,418 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,419 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,421 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,422 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:17:21,447 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:17:21,471 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:17:21,471 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:17:21,471 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:17:21,471 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:17:21,471 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:17:21,471 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:17:21,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:17:21,472 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:17:21,488 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 01:17:21,542 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 01:17:21,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:17:21,548 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:17:21,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 01:17:21,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 01:17:21,559 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:17:21,562 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 01:17:21,565 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 01:17:21,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 01:17:21,592 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 01:17:21,592 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:17:21,593 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-16 01:17:21,596 INFO L117 LiptonReduction]: Number of co-enabled transitions 2454 [2020-10-16 01:17:22,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:22,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:22,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:22,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:22,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:22,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:22,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:22,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:22,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:17:22,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:22,158 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 01:17:22,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:22,160 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 01:17:22,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:22,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:22,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:17:22,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:17:22,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:22,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:22,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:22,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:22,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:22,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:22,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:22,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:22,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:22,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:22,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:22,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:22,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:22,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:22,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:22,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:22,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:22,614 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 01:17:22,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:17:22,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,415 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:17:23,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:17:23,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:23,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:17:23,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:17:23,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:23,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:23,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:23,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:23,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:23,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:23,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:17:23,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,715 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 01:17:23,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,717 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 01:17:23,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:23,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:23,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:23,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:23,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:23,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:23,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:23,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:23,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:24,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:24,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:24,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:24,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:24,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:24,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:17:24,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:17:24,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:17:24,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:24,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:24,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:17:24,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:17:24,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,130 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 01:17:24,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,132 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 01:17:24,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:17:24,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:17:24,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:17:24,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:17:24,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:17:24,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:24,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:17:24,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:17:25,118 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 01:17:25,303 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 01:17:25,319 INFO L132 LiptonReduction]: Checked pairs total: 6159 [2020-10-16 01:17:25,319 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 01:17:25,321 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3765 [2020-10-16 01:17:25,330 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 01:17:25,330 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:17:25,330 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:25,331 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:25,331 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1229482810, now seen corresponding path program 1 times [2020-10-16 01:17:25,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:25,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853480909] [2020-10-16 01:17:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:25,663 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 01:17:25,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853480909] [2020-10-16 01:17:25,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:25,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:17:25,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590227563] [2020-10-16 01:17:25,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:17:25,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:25,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:17:25,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:17:25,695 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 203 [2020-10-16 01:17:25,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:17:25,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:25,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 203 [2020-10-16 01:17:25,700 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:25,761 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2020-10-16 01:17:25,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:17:25,762 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 58 events. 13/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 151 event pairs, 1 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 90. Up to 25 conditions per place. [2020-10-16 01:17:25,764 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 6 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2020-10-16 01:17:25,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 88 flow [2020-10-16 01:17:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:17:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:17:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2020-10-16 01:17:25,783 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8850574712643678 [2020-10-16 01:17:25,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2020-10-16 01:17:25,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2020-10-16 01:17:25,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:25,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2020-10-16 01:17:25,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:17:25,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:17:25,803 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:17:25,805 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 539 transitions. [2020-10-16 01:17:25,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 88 flow [2020-10-16 01:17:25,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 84 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:17:25,812 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 01:17:25,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 01:17:25,816 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 01:17:25,816 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 01:17:25,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:17:25,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:25,816 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:25,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:17:25,817 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:25,817 INFO L82 PathProgramCache]: Analyzing trace with hash 42662040, now seen corresponding path program 1 times [2020-10-16 01:17:25,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:25,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630587282] [2020-10-16 01:17:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:25,914 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 01:17:25,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630587282] [2020-10-16 01:17:25,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:25,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:17:25,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396457427] [2020-10-16 01:17:25,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:17:25,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:17:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:17:25,919 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 203 [2020-10-16 01:17:25,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 01:17:25,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:25,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 203 [2020-10-16 01:17:25,920 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:25,957 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2020-10-16 01:17:25,958 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:17:25,958 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2020-10-16 01:17:25,958 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 2 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2020-10-16 01:17:25,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 94 flow [2020-10-16 01:17:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:17:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:17:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 876 transitions. [2020-10-16 01:17:25,962 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8630541871921182 [2020-10-16 01:17:25,962 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 876 transitions. [2020-10-16 01:17:25,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 876 transitions. [2020-10-16 01:17:25,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:25,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 876 transitions. [2020-10-16 01:17:25,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:17:25,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:17:25,968 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:17:25,968 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 876 transitions. [2020-10-16 01:17:25,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 94 flow [2020-10-16 01:17:25,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:17:25,970 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow [2020-10-16 01:17:25,970 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 01:17:25,971 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 01:17:25,971 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow [2020-10-16 01:17:25,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:17:25,971 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:25,971 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:25,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:17:25,972 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:25,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:25,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1952562282, now seen corresponding path program 1 times [2020-10-16 01:17:25,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:25,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954240723] [2020-10-16 01:17:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:26,052 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 01:17:26,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954240723] [2020-10-16 01:17:26,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:26,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:17:26,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093959503] [2020-10-16 01:17:26,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:17:26,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:17:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:17:26,055 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 203 [2020-10-16 01:17:26,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand 4 states. [2020-10-16 01:17:26,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:26,056 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 203 [2020-10-16 01:17:26,056 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:26,094 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2020-10-16 01:17:26,095 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:17:26,095 INFO L80 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 0/32 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 2/34 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 01:17:26,095 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 2 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2020-10-16 01:17:26,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 29 transitions, 92 flow [2020-10-16 01:17:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:17:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:17:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2020-10-16 01:17:26,099 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8600985221674877 [2020-10-16 01:17:26,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2020-10-16 01:17:26,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2020-10-16 01:17:26,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:26,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2020-10-16 01:17:26,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:17:26,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:17:26,104 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:17:26,104 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states and 873 transitions. [2020-10-16 01:17:26,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 29 transitions, 92 flow [2020-10-16 01:17:26,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 84 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:17:26,106 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2020-10-16 01:17:26,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 01:17:26,107 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 01:17:26,107 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2020-10-16 01:17:26,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:17:26,107 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:26,107 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:26,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:17:26,108 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 487318624, now seen corresponding path program 1 times [2020-10-16 01:17:26,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:26,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907391909] [2020-10-16 01:17:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:26,277 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 01:17:26,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907391909] [2020-10-16 01:17:26,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:26,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:17:26,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172421726] [2020-10-16 01:17:26,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:17:26,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:26,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:17:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:17:26,281 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 203 [2020-10-16 01:17:26,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand 4 states. [2020-10-16 01:17:26,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:26,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 203 [2020-10-16 01:17:26,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:26,368 INFO L129 PetriNetUnfolder]: 90/200 cut-off events. [2020-10-16 01:17:26,369 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-16 01:17:26,370 INFO L80 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 200 events. 90/200 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 967 event pairs, 46 based on Foata normal form. 16/207 useless extension candidates. Maximal degree in co-relation 418. Up to 119 conditions per place. [2020-10-16 01:17:26,372 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2020-10-16 01:17:26,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 144 flow [2020-10-16 01:17:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:17:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:17:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2020-10-16 01:17:26,376 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8394088669950739 [2020-10-16 01:17:26,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2020-10-16 01:17:26,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2020-10-16 01:17:26,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:26,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2020-10-16 01:17:26,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:17:26,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:17:26,380 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:17:26,380 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 5 states and 852 transitions. [2020-10-16 01:17:26,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 144 flow [2020-10-16 01:17:26,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 136 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:17:26,384 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 115 flow [2020-10-16 01:17:26,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2020-10-16 01:17:26,384 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2020-10-16 01:17:26,384 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 115 flow [2020-10-16 01:17:26,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:17:26,385 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:26,385 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:26,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:17:26,385 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 331140420, now seen corresponding path program 1 times [2020-10-16 01:17:26,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:26,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615587367] [2020-10-16 01:17:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:26,556 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 01:17:26,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615587367] [2020-10-16 01:17:26,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:26,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:17:26,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35559341] [2020-10-16 01:17:26,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:17:26,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:26,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:17:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:17:26,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 203 [2020-10-16 01:17:26,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 115 flow. Second operand 5 states. [2020-10-16 01:17:26,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:26,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 203 [2020-10-16 01:17:26,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:26,667 INFO L129 PetriNetUnfolder]: 66/159 cut-off events. [2020-10-16 01:17:26,668 INFO L130 PetriNetUnfolder]: For 124/208 co-relation queries the response was YES. [2020-10-16 01:17:26,668 INFO L80 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 159 events. 66/159 cut-off events. For 124/208 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 649 event pairs, 14 based on Foata normal form. 24/177 useless extension candidates. Maximal degree in co-relation 526. Up to 108 conditions per place. [2020-10-16 01:17:26,670 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 9 changer transitions 9/44 dead transitions. [2020-10-16 01:17:26,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 239 flow [2020-10-16 01:17:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:17:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:17:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2020-10-16 01:17:26,674 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8390804597701149 [2020-10-16 01:17:26,674 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2020-10-16 01:17:26,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2020-10-16 01:17:26,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:26,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2020-10-16 01:17:26,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:17:26,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:17:26,680 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:17:26,680 INFO L185 Difference]: Start difference. First operand has 45 places, 31 transitions, 115 flow. Second operand 6 states and 1022 transitions. [2020-10-16 01:17:26,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 239 flow [2020-10-16 01:17:26,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 232 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:17:26,683 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 180 flow [2020-10-16 01:17:26,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2020-10-16 01:17:26,683 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2020-10-16 01:17:26,683 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 180 flow [2020-10-16 01:17:26,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:17:26,684 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:26,684 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:26,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:17:26,684 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 16505708, now seen corresponding path program 1 times [2020-10-16 01:17:26,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:26,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775447855] [2020-10-16 01:17:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:26,776 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 01:17:26,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775447855] [2020-10-16 01:17:26,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:26,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:17:26,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365168425] [2020-10-16 01:17:26,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:17:26,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:17:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:17:26,779 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 203 [2020-10-16 01:17:26,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 180 flow. Second operand 6 states. [2020-10-16 01:17:26,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:26,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 203 [2020-10-16 01:17:26,781 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:26,876 INFO L129 PetriNetUnfolder]: 36/101 cut-off events. [2020-10-16 01:17:26,877 INFO L130 PetriNetUnfolder]: For 249/379 co-relation queries the response was YES. [2020-10-16 01:17:26,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 101 events. 36/101 cut-off events. For 249/379 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 322 event pairs, 2 based on Foata normal form. 27/124 useless extension candidates. Maximal degree in co-relation 442. Up to 68 conditions per place. [2020-10-16 01:17:26,878 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 6 selfloop transitions, 13 changer transitions 9/48 dead transitions. [2020-10-16 01:17:26,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 362 flow [2020-10-16 01:17:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:17:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:17:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1192 transitions. [2020-10-16 01:17:26,883 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8388458831808585 [2020-10-16 01:17:26,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1192 transitions. [2020-10-16 01:17:26,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1192 transitions. [2020-10-16 01:17:26,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:26,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1192 transitions. [2020-10-16 01:17:26,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:17:26,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:17:26,889 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:17:26,889 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 180 flow. Second operand 7 states and 1192 transitions. [2020-10-16 01:17:26,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 362 flow [2020-10-16 01:17:26,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 300 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 01:17:26,894 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 230 flow [2020-10-16 01:17:26,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2020-10-16 01:17:26,894 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2020-10-16 01:17:26,894 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 230 flow [2020-10-16 01:17:26,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:17:26,895 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:26,895 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:26,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:17:26,895 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 878306592, now seen corresponding path program 1 times [2020-10-16 01:17:26,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:26,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678721766] [2020-10-16 01:17:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:27,007 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 01:17:27,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678721766] [2020-10-16 01:17:27,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:27,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:17:27,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513041775] [2020-10-16 01:17:27,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:17:27,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:17:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:17:27,010 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 203 [2020-10-16 01:17:27,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 230 flow. Second operand 4 states. [2020-10-16 01:17:27,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:27,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 203 [2020-10-16 01:17:27,013 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:27,071 INFO L129 PetriNetUnfolder]: 55/153 cut-off events. [2020-10-16 01:17:27,071 INFO L130 PetriNetUnfolder]: For 391/487 co-relation queries the response was YES. [2020-10-16 01:17:27,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 633 conditions, 153 events. 55/153 cut-off events. For 391/487 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 576 event pairs, 4 based on Foata normal form. 10/145 useless extension candidates. Maximal degree in co-relation 615. Up to 91 conditions per place. [2020-10-16 01:17:27,076 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 7 selfloop transitions, 2 changer transitions 1/43 dead transitions. [2020-10-16 01:17:27,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 263 flow [2020-10-16 01:17:27,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:17:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:17:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2020-10-16 01:17:27,079 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8509852216748769 [2020-10-16 01:17:27,079 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2020-10-16 01:17:27,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2020-10-16 01:17:27,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:27,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2020-10-16 01:17:27,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:17:27,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:17:27,083 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:17:27,084 INFO L185 Difference]: Start difference. First operand has 52 places, 39 transitions, 230 flow. Second operand 4 states and 691 transitions. [2020-10-16 01:17:27,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 263 flow [2020-10-16 01:17:27,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 209 flow, removed 18 selfloop flow, removed 5 redundant places. [2020-10-16 01:17:27,088 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 190 flow [2020-10-16 01:17:27,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2020-10-16 01:17:27,089 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 01:17:27,089 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 190 flow [2020-10-16 01:17:27,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:17:27,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:27,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:27,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:17:27,090 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:27,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -769742072, now seen corresponding path program 2 times [2020-10-16 01:17:27,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:27,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095831905] [2020-10-16 01:17:27,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:27,201 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 01:17:27,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095831905] [2020-10-16 01:17:27,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:27,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:17:27,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493161796] [2020-10-16 01:17:27,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:17:27,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:17:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:17:27,205 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2020-10-16 01:17:27,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 190 flow. Second operand 5 states. [2020-10-16 01:17:27,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:27,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2020-10-16 01:17:27,206 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:27,280 INFO L129 PetriNetUnfolder]: 100/250 cut-off events. [2020-10-16 01:17:27,281 INFO L130 PetriNetUnfolder]: For 497/548 co-relation queries the response was YES. [2020-10-16 01:17:27,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 250 events. 100/250 cut-off events. For 497/548 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1157 event pairs, 8 based on Foata normal form. 14/238 useless extension candidates. Maximal degree in co-relation 789. Up to 121 conditions per place. [2020-10-16 01:17:27,283 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 7 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2020-10-16 01:17:27,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 236 flow [2020-10-16 01:17:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:17:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:17:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 01:17:27,287 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8384236453201971 [2020-10-16 01:17:27,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 01:17:27,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 01:17:27,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:27,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 01:17:27,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:17:27,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:17:27,292 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:17:27,292 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 190 flow. Second operand 5 states and 851 transitions. [2020-10-16 01:17:27,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 236 flow [2020-10-16 01:17:27,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 228 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:17:27,296 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 201 flow [2020-10-16 01:17:27,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2020-10-16 01:17:27,297 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2020-10-16 01:17:27,297 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 201 flow [2020-10-16 01:17:27,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:17:27,297 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:27,297 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:27,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:17:27,298 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1958802102, now seen corresponding path program 3 times [2020-10-16 01:17:27,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:27,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893878250] [2020-10-16 01:17:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:27,410 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 01:17:27,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893878250] [2020-10-16 01:17:27,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:27,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:17:27,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796931139] [2020-10-16 01:17:27,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:17:27,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:17:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:17:27,414 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 203 [2020-10-16 01:17:27,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 201 flow. Second operand 7 states. [2020-10-16 01:17:27,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:27,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 203 [2020-10-16 01:17:27,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:27,569 INFO L129 PetriNetUnfolder]: 77/187 cut-off events. [2020-10-16 01:17:27,569 INFO L130 PetriNetUnfolder]: For 378/698 co-relation queries the response was YES. [2020-10-16 01:17:27,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 187 events. 77/187 cut-off events. For 378/698 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 748 event pairs, 0 based on Foata normal form. 65/226 useless extension candidates. Maximal degree in co-relation 716. Up to 101 conditions per place. [2020-10-16 01:17:27,571 INFO L132 encePairwiseOnDemand]: 196/203 looper letters, 2 selfloop transitions, 17 changer transitions 6/46 dead transitions. [2020-10-16 01:17:27,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 46 transitions, 297 flow [2020-10-16 01:17:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:17:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:17:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1354 transitions. [2020-10-16 01:17:27,576 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.833743842364532 [2020-10-16 01:17:27,576 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1354 transitions. [2020-10-16 01:17:27,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1354 transitions. [2020-10-16 01:17:27,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:27,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1354 transitions. [2020-10-16 01:17:27,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:17:27,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:17:27,583 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:17:27,583 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 201 flow. Second operand 8 states and 1354 transitions. [2020-10-16 01:17:27,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 46 transitions, 297 flow [2020-10-16 01:17:27,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 270 flow, removed 11 selfloop flow, removed 4 redundant places. [2020-10-16 01:17:27,587 INFO L241 Difference]: Finished difference. Result has 59 places, 40 transitions, 226 flow [2020-10-16 01:17:27,587 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2020-10-16 01:17:27,588 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2020-10-16 01:17:27,588 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 226 flow [2020-10-16 01:17:27,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:17:27,588 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:27,588 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:27,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:17:27,588 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:27,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1600464973, now seen corresponding path program 1 times [2020-10-16 01:17:27,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:27,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319737242] [2020-10-16 01:17:27,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:27,688 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 01:17:27,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319737242] [2020-10-16 01:17:27,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:27,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:17:27,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386874596] [2020-10-16 01:17:27,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:17:27,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:17:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:17:27,691 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 203 [2020-10-16 01:17:27,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 226 flow. Second operand 5 states. [2020-10-16 01:17:27,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:27,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 203 [2020-10-16 01:17:27,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:27,741 INFO L129 PetriNetUnfolder]: 66/162 cut-off events. [2020-10-16 01:17:27,742 INFO L130 PetriNetUnfolder]: For 247/291 co-relation queries the response was YES. [2020-10-16 01:17:27,742 INFO L80 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 162 events. 66/162 cut-off events. For 247/291 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 647 event pairs, 0 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 559. Up to 69 conditions per place. [2020-10-16 01:17:27,743 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 4 selfloop transitions, 1 changer transitions 2/42 dead transitions. [2020-10-16 01:17:27,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 248 flow [2020-10-16 01:17:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:17:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:17:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2020-10-16 01:17:27,747 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8305418719211822 [2020-10-16 01:17:27,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 843 transitions. [2020-10-16 01:17:27,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 843 transitions. [2020-10-16 01:17:27,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:27,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 843 transitions. [2020-10-16 01:17:27,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:17:27,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:17:27,751 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:17:27,752 INFO L185 Difference]: Start difference. First operand has 59 places, 40 transitions, 226 flow. Second operand 5 states and 843 transitions. [2020-10-16 01:17:27,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 248 flow [2020-10-16 01:17:27,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 186 flow, removed 17 selfloop flow, removed 8 redundant places. [2020-10-16 01:17:27,755 INFO L241 Difference]: Finished difference. Result has 56 places, 40 transitions, 175 flow [2020-10-16 01:17:27,755 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2020-10-16 01:17:27,755 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2020-10-16 01:17:27,756 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 175 flow [2020-10-16 01:17:27,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:17:27,756 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:27,756 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:27,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:17:27,756 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash -695365145, now seen corresponding path program 2 times [2020-10-16 01:17:27,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:27,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059963751] [2020-10-16 01:17:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:17:28,233 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 01:17:28,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059963751] [2020-10-16 01:17:28,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:17:28,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 01:17:28,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32648446] [2020-10-16 01:17:28,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 01:17:28,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:17:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 01:17:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-10-16 01:17:28,237 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 203 [2020-10-16 01:17:28,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 175 flow. Second operand 13 states. [2020-10-16 01:17:28,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:17:28,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 203 [2020-10-16 01:17:28,239 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:17:29,352 INFO L129 PetriNetUnfolder]: 320/615 cut-off events. [2020-10-16 01:17:29,353 INFO L130 PetriNetUnfolder]: For 717/917 co-relation queries the response was YES. [2020-10-16 01:17:29,357 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2052 conditions, 615 events. 320/615 cut-off events. For 717/917 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3308 event pairs, 14 based on Foata normal form. 36/624 useless extension candidates. Maximal degree in co-relation 2037. Up to 275 conditions per place. [2020-10-16 01:17:29,361 INFO L132 encePairwiseOnDemand]: 192/203 looper letters, 19 selfloop transitions, 15 changer transitions 66/115 dead transitions. [2020-10-16 01:17:29,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 721 flow [2020-10-16 01:17:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-16 01:17:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-16 01:17:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2211 transitions. [2020-10-16 01:17:29,373 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6406838597507969 [2020-10-16 01:17:29,373 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2211 transitions. [2020-10-16 01:17:29,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2211 transitions. [2020-10-16 01:17:29,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:17:29,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2211 transitions. [2020-10-16 01:17:29,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-16 01:17:29,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-16 01:17:29,389 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-16 01:17:29,389 INFO L185 Difference]: Start difference. First operand has 56 places, 40 transitions, 175 flow. Second operand 17 states and 2211 transitions. [2020-10-16 01:17:29,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 721 flow [2020-10-16 01:17:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 712 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:17:29,410 INFO L241 Difference]: Finished difference. Result has 79 places, 48 transitions, 322 flow [2020-10-16 01:17:29,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=322, PETRI_PLACES=79, PETRI_TRANSITIONS=48} [2020-10-16 01:17:29,411 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2020-10-16 01:17:29,411 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 48 transitions, 322 flow [2020-10-16 01:17:29,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 01:17:29,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:17:29,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:17:29,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:17:29,412 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:17:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:17:29,413 INFO L82 PathProgramCache]: Analyzing trace with hash -525718171, now seen corresponding path program 3 times [2020-10-16 01:17:29,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:17:29,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710437375] [2020-10-16 01:17:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:17:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:17:29,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:17:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:17:29,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:17:29,686 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:17:29,686 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:17:29,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:17:29,717 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 01:17:29,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,717 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 01:17:29,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,718 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 01:17:29,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,718 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 01:17:29,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,719 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 01:17:29,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,719 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 01:17:29,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,719 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 01:17:29,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,720 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 01:17:29,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,720 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 01:17:29,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,720 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 01:17:29,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,721 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 01:17:29,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,721 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 01:17:29,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,721 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 01:17:29,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,722 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 01:17:29,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,723 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 01:17:29,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,724 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 01:17:29,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,724 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 01:17:29,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,725 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 01:17:29,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,725 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 01:17:29,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,725 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 01:17:29,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,726 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 01:17:29,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,726 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 01:17:29,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,726 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 01:17:29,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,727 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 01:17:29,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,727 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 01:17:29,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,727 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 01:17:29,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,728 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 01:17:29,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,728 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 01:17:29,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,729 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 01:17:29,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,729 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 01:17:29,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,730 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 01:17:29,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,730 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 01:17:29,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,731 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 01:17:29,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,731 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 01:17:29,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,731 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 01:17:29,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,732 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 01:17:29,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,732 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 01:17:29,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,732 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 01:17:29,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:17:29,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:17:29 BasicIcfg [2020-10-16 01:17:29,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:17:29,817 INFO L168 Benchmark]: Toolchain (without parser) took 11966.72 ms. Allocated memory was 247.5 MB in the beginning and 610.8 MB in the end (delta: 363.3 MB). Free memory was 200.1 MB in the beginning and 540.2 MB in the end (delta: -340.1 MB). Peak memory consumption was 335.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,818 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 247.5 MB. Free memory is still 221.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:17:29,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.23 ms. Allocated memory was 247.5 MB in the beginning and 304.6 MB in the end (delta: 57.1 MB). Free memory was 200.1 MB in the beginning and 250.4 MB in the end (delta: -50.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.35 ms. Allocated memory is still 304.6 MB. Free memory was 250.4 MB in the beginning and 247.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,821 INFO L168 Benchmark]: Boogie Preprocessor took 43.63 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 245.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,821 INFO L168 Benchmark]: RCFGBuilder took 2495.81 ms. Allocated memory was 304.6 MB in the beginning and 368.1 MB in the end (delta: 63.4 MB). Free memory was 245.3 MB in the beginning and 311.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 145.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,822 INFO L168 Benchmark]: TraceAbstraction took 8500.63 ms. Allocated memory was 368.1 MB in the beginning and 610.8 MB in the end (delta: 242.7 MB). Free memory was 311.5 MB in the beginning and 540.2 MB in the end (delta: -228.7 MB). Peak memory consumption was 326.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:17:29,826 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.44 ms. Allocated memory is still 247.5 MB. Free memory is still 221.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 848.23 ms. Allocated memory was 247.5 MB in the beginning and 304.6 MB in the end (delta: 57.1 MB). Free memory was 200.1 MB in the beginning and 250.4 MB in the end (delta: -50.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.35 ms. Allocated memory is still 304.6 MB. Free memory was 250.4 MB in the beginning and 247.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 43.63 ms. Allocated memory is still 304.6 MB. Free memory was 247.8 MB in the beginning and 245.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2495.81 ms. Allocated memory was 304.6 MB in the beginning and 368.1 MB in the end (delta: 63.4 MB). Free memory was 245.3 MB in the beginning and 311.5 MB in the end (delta: -66.2 MB). Peak memory consumption was 145.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8500.63 ms. Allocated memory was 368.1 MB in the beginning and 610.8 MB in the end (delta: 242.7 MB). Free memory was 311.5 MB in the beginning and 540.2 MB in the end (delta: -228.7 MB). Peak memory consumption was 326.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1563 VarBasedMoverChecksPositive, 80 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 207 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 119 PlacesBefore, 42 PlacesAfterwards, 108 TransitionsBefore, 30 TransitionsAfterwards, 2454 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 6159 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p1_EBX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L858] 0 pthread_t t373; [L859] FCALL, FORK 0 pthread_create(&t373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t374; [L861] FCALL, FORK 0 pthread_create(&t374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t375; [L863] FCALL, FORK 0 pthread_create(&t375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t376; [L865] FCALL, FORK 0 pthread_create(&t376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 1 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 4 z$flush_delayed = weak$$choice2 [L820] 4 z$mem_tmp = z [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L821] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L822] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L822] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L823] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L823] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L824] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L825] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L826] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L826] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L826] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L827] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 __unbuffered_p3_EAX = z [L829] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L829] 4 z = z$flush_delayed ? z$mem_tmp : z [L830] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 z$flush_delayed = weak$$choice2 [L782] 3 z$mem_tmp = z [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L783] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L784] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L784] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L785] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L786] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L786] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L787] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L789] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = z [L791] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L791] 3 z = z$flush_delayed ? z$mem_tmp : z [L792] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L871] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 53 SDtfs, 48 SDslu, 74 SDs, 0 SdLazy, 630 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 24579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...