/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:41:45,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:41:45,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:41:45,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:41:45,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:41:45,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:41:45,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:41:45,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:41:45,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:41:45,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:41:45,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:41:45,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:41:45,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:41:45,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:41:45,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:41:45,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:41:45,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:41:45,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:41:45,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:41:45,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:41:45,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:41:45,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:41:45,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:41:45,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:41:45,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:41:45,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:41:45,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:41:45,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:41:45,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:41:45,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:41:45,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:41:45,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:41:45,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:41:45,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:41:45,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:41:45,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:41:45,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:41:45,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:41:45,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:41:45,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:41:45,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:41:45,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 12:41:45,528 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:41:45,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:41:45,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:41:45,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:41:45,530 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:41:45,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:41:45,530 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:41:45,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:41:45,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:41:45,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:41:45,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:41:45,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:41:45,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:41:45,532 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:41:45,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:41:45,532 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:41:45,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:41:45,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:41:45,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:41:45,533 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:41:45,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:41:45,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:41:45,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:41:45,534 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:41:45,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:41:45,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:41:45,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:41:45,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:41:45,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:41:45,840 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:41:45,841 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2020-10-09 12:41:45,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549c8771d/7fbac1271a934166bfc76a3b1b477b97/FLAGcc47ac4fb [2020-10-09 12:41:46,521 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:41:46,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2020-10-09 12:41:46,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549c8771d/7fbac1271a934166bfc76a3b1b477b97/FLAGcc47ac4fb [2020-10-09 12:41:46,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/549c8771d/7fbac1271a934166bfc76a3b1b477b97 [2020-10-09 12:41:46,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:41:46,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:41:46,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:41:46,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:41:46,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:41:46,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:41:46" (1/1) ... [2020-10-09 12:41:46,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c34d5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:46, skipping insertion in model container [2020-10-09 12:41:46,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:41:46" (1/1) ... [2020-10-09 12:41:46,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:41:46,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:41:47,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:41:47,462 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:41:47,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:41:47,605 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:41:47,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47 WrapperNode [2020-10-09 12:41:47,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:41:47,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:41:47,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:41:47,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:41:47,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:41:47,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:41:47,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:41:47,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:41:47,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (1/1) ... [2020-10-09 12:41:47,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:41:47,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:41:47,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:41:47,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:41:47,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (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-09 12:41:47,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:41:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:41:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:41:47,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:41:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:41:47,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:41:47,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:41:47,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:41:47,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:41:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:41:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-09 12:41:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-09 12:41:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:41:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:41:47,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:41:47,793 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:41:49,534 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:41:49,534 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:41:49,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:41:49 BoogieIcfgContainer [2020-10-09 12:41:49,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:41:49,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:41:49,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:41:49,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:41:49,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:41:46" (1/3) ... [2020-10-09 12:41:49,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4169c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:41:49, skipping insertion in model container [2020-10-09 12:41:49,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:41:47" (2/3) ... [2020-10-09 12:41:49,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4169c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:41:49, skipping insertion in model container [2020-10-09 12:41:49,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:41:49" (3/3) ... [2020-10-09 12:41:49,546 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2020-10-09 12:41:49,558 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:41:49,559 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:41:49,568 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:41:49,569 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:41:49,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,611 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,619 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,619 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,619 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,619 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,641 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,642 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:41:49,660 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-09 12:41:49,681 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:41:49,681 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:41:49,682 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:41:49,682 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:41:49,682 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:41:49,682 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:41:49,682 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:41:49,682 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:41:49,698 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:41:49,701 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-09 12:41:49,704 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-09 12:41:49,706 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-09 12:41:49,759 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-09 12:41:49,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:41:49,765 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 76 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-09 12:41:49,769 INFO L117 LiptonReduction]: Number of co-enabled transitions 2432 [2020-10-09 12:41:49,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:49,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:50,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:50,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:50,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:50,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:50,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:50,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:50,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:50,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:50,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:50,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:50,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:50,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:50,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:50,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:50,607 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 12:41:50,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:50,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:41:50,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:41:50,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:50,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:50,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:50,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:50,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:50,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:50,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:50,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:50,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:50,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:41:50,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:50,825 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-09 12:41:50,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:50,827 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-09 12:41:50,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:51,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:41:51,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,117 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-09 12:41:51,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,119 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-09 12:41:51,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:41:51,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:41:51,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:51,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:51,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:51,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:51,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:51,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:51,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:51,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:51,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:41:51,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:51,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:51,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:41:51,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:41:51,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:41:51,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:51,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:51,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:51,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:41:51,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,455 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-09 12:41:51,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,456 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-09 12:41:51,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:41:51,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:51,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-09 12:41:51,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:52,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:41:52,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:41:52,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:52,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:52,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:52,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:52,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:41:52,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:41:52,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:41:52,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:52,020 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-09 12:41:52,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:52,022 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-09 12:41:52,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:52,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:41:52,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:41:52,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:41:52,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:41:53,657 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-09 12:41:53,796 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-09 12:41:54,000 INFO L132 LiptonReduction]: Checked pairs total: 5891 [2020-10-09 12:41:54,001 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-09 12:41:54,007 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-09 12:41:54,187 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2410 states. [2020-10-09 12:41:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states. [2020-10-09 12:41:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 12:41:54,198 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:54,199 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:54,200 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-09 12:41:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:54,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1749114566, now seen corresponding path program 1 times [2020-10-09 12:41:54,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:54,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050996382] [2020-10-09 12:41:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:54,475 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-09 12:41:54,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050996382] [2020-10-09 12:41:54,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:54,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:41:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216647769] [2020-10-09 12:41:54,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:41:54,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:41:54,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:54,502 INFO L87 Difference]: Start difference. First operand 2410 states. Second operand 3 states. [2020-10-09 12:41:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:54,593 INFO L93 Difference]: Finished difference Result 2090 states and 7968 transitions. [2020-10-09 12:41:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:41:54,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 12:41:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:54,646 INFO L225 Difference]: With dead ends: 2090 [2020-10-09 12:41:54,646 INFO L226 Difference]: Without dead ends: 1706 [2020-10-09 12:41:54,647 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-10-09 12:41:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2020-10-09 12:41:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-10-09 12:41:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2020-10-09 12:41:54,838 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2020-10-09 12:41:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:54,839 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2020-10-09 12:41:54,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:41:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2020-10-09 12:41:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:41:54,844 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:54,844 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:54,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:41:54,844 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-09 12:41:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1566846539, now seen corresponding path program 1 times [2020-10-09 12:41:54,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:54,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2766866] [2020-10-09 12:41:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:54,945 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-09 12:41:54,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2766866] [2020-10-09 12:41:54,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:54,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:41:54,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665681484] [2020-10-09 12:41:54,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:41:54,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:41:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:54,949 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand 3 states. [2020-10-09 12:41:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:54,970 INFO L93 Difference]: Finished difference Result 1578 states and 5856 transitions. [2020-10-09 12:41:54,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:41:54,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-09 12:41:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:54,985 INFO L225 Difference]: With dead ends: 1578 [2020-10-09 12:41:54,985 INFO L226 Difference]: Without dead ends: 1578 [2020-10-09 12:41:54,986 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2020-10-09 12:41:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2020-10-09 12:41:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-10-09 12:41:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5856 transitions. [2020-10-09 12:41:55,055 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 5856 transitions. Word has length 11 [2020-10-09 12:41:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,055 INFO L481 AbstractCegarLoop]: Abstraction has 1578 states and 5856 transitions. [2020-10-09 12:41:55,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:41:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 5856 transitions. [2020-10-09 12:41:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 12:41:55,059 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,059 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:41:55,059 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-09 12:41:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1793977970, now seen corresponding path program 1 times [2020-10-09 12:41:55,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697760641] [2020-10-09 12:41:55,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,113 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-09 12:41:55,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697760641] [2020-10-09 12:41:55,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:41:55,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725695063] [2020-10-09 12:41:55,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:41:55,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:41:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:55,115 INFO L87 Difference]: Start difference. First operand 1578 states and 5856 transitions. Second operand 3 states. [2020-10-09 12:41:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,141 INFO L93 Difference]: Finished difference Result 1546 states and 5712 transitions. [2020-10-09 12:41:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:41:55,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-09 12:41:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,155 INFO L225 Difference]: With dead ends: 1546 [2020-10-09 12:41:55,155 INFO L226 Difference]: Without dead ends: 1546 [2020-10-09 12:41:55,156 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-10-09 12:41:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2020-10-09 12:41:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-10-09 12:41:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5712 transitions. [2020-10-09 12:41:55,211 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5712 transitions. Word has length 13 [2020-10-09 12:41:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,211 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 5712 transitions. [2020-10-09 12:41:55,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:41:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5712 transitions. [2020-10-09 12:41:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 12:41:55,214 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,214 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:41:55,215 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-09 12:41:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1439826351, now seen corresponding path program 1 times [2020-10-09 12:41:55,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282411484] [2020-10-09 12:41:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,293 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-09 12:41:55,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282411484] [2020-10-09 12:41:55,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:41:55,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120873944] [2020-10-09 12:41:55,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:41:55,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:41:55,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:41:55,295 INFO L87 Difference]: Start difference. First operand 1546 states and 5712 transitions. Second operand 4 states. [2020-10-09 12:41:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,354 INFO L93 Difference]: Finished difference Result 1597 states and 5366 transitions. [2020-10-09 12:41:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:41:55,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-09 12:41:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,364 INFO L225 Difference]: With dead ends: 1597 [2020-10-09 12:41:55,364 INFO L226 Difference]: Without dead ends: 1213 [2020-10-09 12:41:55,365 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:41:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-10-09 12:41:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2020-10-09 12:41:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2020-10-09 12:41:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4047 transitions. [2020-10-09 12:41:55,403 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 4047 transitions. Word has length 14 [2020-10-09 12:41:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,403 INFO L481 AbstractCegarLoop]: Abstraction has 1213 states and 4047 transitions. [2020-10-09 12:41:55,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:41:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 4047 transitions. [2020-10-09 12:41:55,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-09 12:41:55,406 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,407 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:41:55,407 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-09 12:41:55,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1866357709, now seen corresponding path program 1 times [2020-10-09 12:41:55,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958658993] [2020-10-09 12:41:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,480 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-09 12:41:55,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958658993] [2020-10-09 12:41:55,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:41:55,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191915720] [2020-10-09 12:41:55,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:41:55,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:41:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:41:55,482 INFO L87 Difference]: Start difference. First operand 1213 states and 4047 transitions. Second operand 5 states. [2020-10-09 12:41:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,546 INFO L93 Difference]: Finished difference Result 1042 states and 3173 transitions. [2020-10-09 12:41:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:41:55,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-09 12:41:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,552 INFO L225 Difference]: With dead ends: 1042 [2020-10-09 12:41:55,553 INFO L226 Difference]: Without dead ends: 793 [2020-10-09 12:41:55,553 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:41:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-10-09 12:41:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2020-10-09 12:41:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-10-09 12:41:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2367 transitions. [2020-10-09 12:41:55,578 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2367 transitions. Word has length 16 [2020-10-09 12:41:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,578 INFO L481 AbstractCegarLoop]: Abstraction has 793 states and 2367 transitions. [2020-10-09 12:41:55,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:41:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2367 transitions. [2020-10-09 12:41:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:41:55,580 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,581 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:41:55,581 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-09 12:41:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 54611181, now seen corresponding path program 1 times [2020-10-09 12:41:55,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532138262] [2020-10-09 12:41:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,644 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-09 12:41:55,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532138262] [2020-10-09 12:41:55,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:41:55,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613040411] [2020-10-09 12:41:55,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:41:55,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:41:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:41:55,647 INFO L87 Difference]: Start difference. First operand 793 states and 2367 transitions. Second operand 4 states. [2020-10-09 12:41:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,668 INFO L93 Difference]: Finished difference Result 1109 states and 3220 transitions. [2020-10-09 12:41:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:41:55,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-09 12:41:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,675 INFO L225 Difference]: With dead ends: 1109 [2020-10-09 12:41:55,675 INFO L226 Difference]: Without dead ends: 811 [2020-10-09 12:41:55,675 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:41:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-10-09 12:41:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 793. [2020-10-09 12:41:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-10-09 12:41:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2249 transitions. [2020-10-09 12:41:55,698 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2249 transitions. Word has length 19 [2020-10-09 12:41:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,699 INFO L481 AbstractCegarLoop]: Abstraction has 793 states and 2249 transitions. [2020-10-09 12:41:55,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:41:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2249 transitions. [2020-10-09 12:41:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:41:55,701 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,701 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:41:55,702 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-09 12:41:55,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1687033143, now seen corresponding path program 1 times [2020-10-09 12:41:55,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583982190] [2020-10-09 12:41:55,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,749 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-09 12:41:55,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583982190] [2020-10-09 12:41:55,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:41:55,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193164259] [2020-10-09 12:41:55,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:41:55,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:41:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:55,752 INFO L87 Difference]: Start difference. First operand 793 states and 2249 transitions. Second operand 3 states. [2020-10-09 12:41:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,766 INFO L93 Difference]: Finished difference Result 1113 states and 3039 transitions. [2020-10-09 12:41:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:41:55,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-09 12:41:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,772 INFO L225 Difference]: With dead ends: 1113 [2020-10-09 12:41:55,772 INFO L226 Difference]: Without dead ends: 803 [2020-10-09 12:41:55,773 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:41:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2020-10-09 12:41:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 785. [2020-10-09 12:41:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-10-09 12:41:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2102 transitions. [2020-10-09 12:41:55,797 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2102 transitions. Word has length 19 [2020-10-09 12:41:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,798 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 2102 transitions. [2020-10-09 12:41:55,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:41:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2102 transitions. [2020-10-09 12:41:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:41:55,800 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,801 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:41:55,801 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-09 12:41:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1063520327, now seen corresponding path program 1 times [2020-10-09 12:41:55,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401595538] [2020-10-09 12:41:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:55,880 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-09 12:41:55,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401595538] [2020-10-09 12:41:55,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:55,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:41:55,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997463721] [2020-10-09 12:41:55,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:41:55,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:41:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:41:55,883 INFO L87 Difference]: Start difference. First operand 785 states and 2102 transitions. Second operand 6 states. [2020-10-09 12:41:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:55,957 INFO L93 Difference]: Finished difference Result 683 states and 1783 transitions. [2020-10-09 12:41:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:41:55,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-09 12:41:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:55,962 INFO L225 Difference]: With dead ends: 683 [2020-10-09 12:41:55,962 INFO L226 Difference]: Without dead ends: 548 [2020-10-09 12:41:55,963 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:41:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-09 12:41:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-09 12:41:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-09 12:41:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1413 transitions. [2020-10-09 12:41:55,980 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1413 transitions. Word has length 19 [2020-10-09 12:41:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:55,980 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1413 transitions. [2020-10-09 12:41:55,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:41:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1413 transitions. [2020-10-09 12:41:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:41:55,983 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:55,983 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:55,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:41:55,983 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-09 12:41:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash 672001859, now seen corresponding path program 1 times [2020-10-09 12:41:55,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:55,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693811053] [2020-10-09 12:41:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:56,127 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-09 12:41:56,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693811053] [2020-10-09 12:41:56,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:56,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 12:41:56,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362818449] [2020-10-09 12:41:56,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:41:56,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:41:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:41:56,131 INFO L87 Difference]: Start difference. First operand 548 states and 1413 transitions. Second operand 7 states. [2020-10-09 12:41:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:56,211 INFO L93 Difference]: Finished difference Result 524 states and 1365 transitions. [2020-10-09 12:41:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:41:56,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-09 12:41:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:56,214 INFO L225 Difference]: With dead ends: 524 [2020-10-09 12:41:56,214 INFO L226 Difference]: Without dead ends: 209 [2020-10-09 12:41:56,215 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:41:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-09 12:41:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-09 12:41:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-09 12:41:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 505 transitions. [2020-10-09 12:41:56,222 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 505 transitions. Word has length 22 [2020-10-09 12:41:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:56,222 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 505 transitions. [2020-10-09 12:41:56,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:41:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 505 transitions. [2020-10-09 12:41:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-09 12:41:56,224 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:56,224 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:56,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:41:56,225 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-09 12:41:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1863618656, now seen corresponding path program 1 times [2020-10-09 12:41:56,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:56,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806766395] [2020-10-09 12:41:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:41:56,363 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-09 12:41:56,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806766395] [2020-10-09 12:41:56,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:41:56,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:41:56,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197959784] [2020-10-09 12:41:56,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:41:56,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:41:56,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:41:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:41:56,365 INFO L87 Difference]: Start difference. First operand 209 states and 505 transitions. Second operand 4 states. [2020-10-09 12:41:56,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:41:56,380 INFO L93 Difference]: Finished difference Result 274 states and 654 transitions. [2020-10-09 12:41:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:41:56,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-09 12:41:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:41:56,382 INFO L225 Difference]: With dead ends: 274 [2020-10-09 12:41:56,382 INFO L226 Difference]: Without dead ends: 80 [2020-10-09 12:41:56,382 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:41:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-09 12:41:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-09 12:41:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-09 12:41:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2020-10-09 12:41:56,385 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 25 [2020-10-09 12:41:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:41:56,386 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2020-10-09 12:41:56,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:41:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2020-10-09 12:41:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-09 12:41:56,387 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:41:56,387 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:41:56,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:41:56,387 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-09 12:41:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:41:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1080705768, now seen corresponding path program 2 times [2020-10-09 12:41:56,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:41:56,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000223436] [2020-10-09 12:41:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:41:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:41:56,471 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:41:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:41:56,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:41:56,580 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:41:56,580 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:41:56,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:41:56,581 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 12:41:56,600 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L2-->L863: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In-600071670 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-600071670 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-600071670 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-600071670 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 (= ~z~0_Out-600071670 ~z$w_buff0~0_In-600071670) .cse1) (and (or (and .cse2 (= ~z~0_In-600071670 ~z~0_Out-600071670)) (and .cse3 .cse4 (= ~z$w_buff1~0_In-600071670 ~z~0_Out-600071670))) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-600071670 0)) (= ~z$r_buff0_thd0~0_Out-600071670 ~z$r_buff0_thd0~0_In-600071670) (or (and (= ~z$w_buff1_used~0_Out-600071670 ~z$w_buff1_used~0_In-600071670) .cse2) (and (= ~z$w_buff1_used~0_Out-600071670 0) .cse3 .cse4)) (= ~z$r_buff1_thd0~0_Out-600071670 ~z$r_buff1_thd0~0_In-600071670) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-600071670 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-600071670|) (or (and .cse5 (= ~z$w_buff0_used~0_In-600071670 ~z$w_buff0_used~0_Out-600071670)) (and .cse0 (= ~z$w_buff0_used~0_Out-600071670 0) .cse1))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-600071670|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-600071670, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-600071670, ~z$w_buff0~0=~z$w_buff0~0_In-600071670, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-600071670, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-600071670, ~z$w_buff1~0=~z$w_buff1~0_In-600071670, ~z~0=~z~0_In-600071670} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-600071670, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-600071670|, ~z$w_buff0~0=~z$w_buff0~0_In-600071670, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-600071670, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-600071670|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-600071670|, ~z$w_buff1~0=~z$w_buff1~0_In-600071670, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-600071670|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-600071670|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-600071670|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-600071670, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-600071670|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-600071670, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-600071670, ~z~0=~z~0_Out-600071670} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-09 12:41:56,615 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-09 12:41:56,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,618 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-09 12:41:56,618 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,619 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-09 12:41:56,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,619 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-09 12:41:56,619 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,620 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-09 12:41:56,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,620 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-09 12:41:56,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,621 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-09 12:41:56,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,621 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-09 12:41:56,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,622 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-09 12:41:56,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,622 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-09 12:41:56,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,623 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-09 12:41:56,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,623 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-09 12:41:56,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,624 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-09 12:41:56,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,624 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-09 12:41:56,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,630 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-09 12:41:56,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,630 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-09 12:41:56,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,631 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-09 12:41:56,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:41:56,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:41:56 BasicIcfg [2020-10-09 12:41:56,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:41:56,740 INFO L168 Benchmark]: Toolchain (without parser) took 9970.44 ms. Allocated memory was 250.1 MB in the beginning and 522.2 MB in the end (delta: 272.1 MB). Free memory was 204.8 MB in the beginning and 428.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 49.0 MB. Max. memory is 14.2 GB. [2020-10-09 12:41:56,740 INFO L168 Benchmark]: CDTParser took 1.45 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:41:56,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.71 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 204.8 MB in the beginning and 262.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-09 12:41:56,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.85 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:41:56,742 INFO L168 Benchmark]: Boogie Preprocessor took 37.90 ms. Allocated memory is still 310.4 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:41:56,743 INFO L168 Benchmark]: RCFGBuilder took 1827.37 ms. Allocated memory was 310.4 MB in the beginning and 356.0 MB in the end (delta: 45.6 MB). Free memory was 257.9 MB in the beginning and 234.3 MB in the end (delta: 23.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:41:56,744 INFO L168 Benchmark]: TraceAbstraction took 7199.20 ms. Allocated memory was 356.0 MB in the beginning and 522.2 MB in the end (delta: 166.2 MB). Free memory was 234.3 MB in the beginning and 428.0 MB in the end (delta: -193.7 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:41:56,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 835.71 ms. Allocated memory was 250.1 MB in the beginning and 310.4 MB in the end (delta: 60.3 MB). Free memory was 204.8 MB in the beginning and 262.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.85 ms. Allocated memory is still 310.4 MB. Free memory was 262.9 MB in the beginning and 260.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.90 ms. Allocated memory is still 310.4 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1827.37 ms. Allocated memory was 310.4 MB in the beginning and 356.0 MB in the end (delta: 45.6 MB). Free memory was 257.9 MB in the beginning and 234.3 MB in the end (delta: 23.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7199.20 ms. Allocated memory was 356.0 MB in the beginning and 522.2 MB in the end (delta: 166.2 MB). Free memory was 234.3 MB in the beginning and 428.0 MB in the end (delta: -193.7 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1542 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 171 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 123 PlacesBefore, 44 PlacesAfterwards, 112 TransitionsBefore, 31 TransitionsAfterwards, 2432 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5891 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_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 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; [L845] 0 pthread_t t989; [L846] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t990; [L848] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t991; [L850] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 pthread_t t992; [L852] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff1 = z$w_buff0 [L802] 4 z$w_buff0 = 1 [L803] 4 z$w_buff1_used = z$w_buff0_used [L804] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 a = 1 [L817] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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 = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L773] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z [L780] 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) [L780] 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) [L781] 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)) [L781] 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) [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L781] 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) [L781] 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)) [L781] 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)) [L782] 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)) [L782] 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) [L782] 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)) [L782] 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)) [L783] 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)) [L783] 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)) [L784] 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)) [L784] 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)) [L785] 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)) [L785] 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)) [L786] 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)) [L786] 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)) [L787] 3 __unbuffered_p2_EAX = z [L788] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L788] 3 z = z$flush_delayed ? z$mem_tmp : z [L789] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, 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] [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L823] 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) [L823] 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) [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 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 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L827] 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 [L830] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 4 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 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=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, 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. VerificationResult: UNSAFE, OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 325 SDtfs, 319 SDslu, 472 SDs, 0 SdLazy, 178 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 7159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...