/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:33:27,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:33:27,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:33:27,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:33:27,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:33:27,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:33:27,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:33:27,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:33:27,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:33:27,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:33:27,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:33:27,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:33:27,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:33:27,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:33:27,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:33:27,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:33:27,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:33:27,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:33:27,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:33:27,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:33:27,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:33:27,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:33:27,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:33:27,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:33:27,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:33:27,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:33:27,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:33:27,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:33:27,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:33:27,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:33:27,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:33:27,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:33:27,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:33:27,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:33:27,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:33:27,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:33:27,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:33:27,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:33:27,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:33:27,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:33:27,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:33:27,404 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:33:27,426 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:33:27,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:33:27,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:33:27,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:33:27,428 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:33:27,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:33:27,428 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:33:27,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:33:27,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:33:27,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:33:27,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:33:27,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:33:27,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:33:27,429 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:33:27,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:33:27,430 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:33:27,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:33:27,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:33:27,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:33:27,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:33:27,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:33:27,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:33:27,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:33:27,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:33:27,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:33:27,432 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:33:27,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:33:27,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:33:27,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:33:27,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:33:27,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:33:27,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:33:27,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:33:27,761 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:33:27,761 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.oepc.i [2020-10-16 01:33:27,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d416ac3f/337e2f68f40344bcbd22ca0721bf3dc1/FLAG08ff34a5a [2020-10-16 01:33:28,352 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:33:28,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_rmo.oepc.i [2020-10-16 01:33:28,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d416ac3f/337e2f68f40344bcbd22ca0721bf3dc1/FLAG08ff34a5a [2020-10-16 01:33:28,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d416ac3f/337e2f68f40344bcbd22ca0721bf3dc1 [2020-10-16 01:33:28,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:33:28,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:33:28,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:33:28,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:33:28,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:33:28,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:33:28" (1/1) ... [2020-10-16 01:33:28,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce8eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:28, skipping insertion in model container [2020-10-16 01:33:28,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:33:28" (1/1) ... [2020-10-16 01:33:28,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:33:28,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:33:29,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:33:29,355 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:33:29,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:33:29,483 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:33:29,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29 WrapperNode [2020-10-16 01:33:29,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:33:29,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:33:29,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:33:29,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:33:29,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:33:29,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:33:29,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:33:29,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:33:29,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... [2020-10-16 01:33:29,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:33:29,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:33:29,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:33:29,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:33:29,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:33:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:33:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:33:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:33:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:33:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:33:29,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:33:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:33:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:33:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:33:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:33:29,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:33:29,662 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:33:31,466 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:33:31,467 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:33:31,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:33:31 BoogieIcfgContainer [2020-10-16 01:33:31,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:33:31,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:33:31,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:33:31,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:33:31,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:33:28" (1/3) ... [2020-10-16 01:33:31,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690cf6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:33:31, skipping insertion in model container [2020-10-16 01:33:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:29" (2/3) ... [2020-10-16 01:33:31,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690cf6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:33:31, skipping insertion in model container [2020-10-16 01:33:31,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:33:31" (3/3) ... [2020-10-16 01:33:31,478 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.oepc.i [2020-10-16 01:33:31,491 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:33:31,499 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:33:31,500 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:33:31,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,530 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,530 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,560 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:31,579 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:33:31,603 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:33:31,603 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:33:31,603 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:33:31,603 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:33:31,603 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:33:31,603 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:33:31,604 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:33:31,604 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:33:31,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:33:31,664 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:33:31,664 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:31,670 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 01:33:31,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2020-10-16 01:33:31,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2020-10-16 01:33:31,681 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:33:31,685 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:33:31,691 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2020-10-16 01:33:31,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2020-10-16 01:33:31,734 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-16 01:33:31,734 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:31,735 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 01:33:31,740 INFO L117 LiptonReduction]: Number of co-enabled transitions 936 [2020-10-16 01:33:32,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:32,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:32,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:32,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:32,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:32,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:32,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:32,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:32,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:32,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:32,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:32,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:32,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:32,822 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:33:32,927 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:33:33,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:33,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:33,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:33,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:33,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:33,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:33,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:33:33,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:33,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:33,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:33,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:33,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:33,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:33,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:33,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,073 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:33:34,206 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:33:34,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:34,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:33:34,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:34,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:33:34,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:34,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:34,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:34,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:34,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:34,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:34,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:34,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:34,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:34,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:34,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:34,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:34,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:35,700 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 01:33:35,799 INFO L132 LiptonReduction]: Checked pairs total: 2089 [2020-10-16 01:33:35,799 INFO L134 LiptonReduction]: Total number of compositions: 71 [2020-10-16 01:33:35,802 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4123 [2020-10-16 01:33:35,808 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:33:35,809 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:35,809 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:35,810 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:33:35,810 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 787969272, now seen corresponding path program 1 times [2020-10-16 01:33:35,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:35,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012334401] [2020-10-16 01:33:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:36,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012334401] [2020-10-16 01:33:36,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:36,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:33:36,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494654945] [2020-10-16 01:33:36,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:33:36,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:33:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:33:36,072 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 150 [2020-10-16 01:33:36,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 01:33:36,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:36,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 150 [2020-10-16 01:33:36,077 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:36,130 INFO L129 PetriNetUnfolder]: 9/44 cut-off events. [2020-10-16 01:33:36,130 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:36,131 INFO L80 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 44 events. 9/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 122 event pairs, 3 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 64. Up to 17 conditions per place. [2020-10-16 01:33:36,132 INFO L132 encePairwiseOnDemand]: 147/150 looper letters, 5 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 01:33:36,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 18 transitions, 56 flow [2020-10-16 01:33:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:33:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:33:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2020-10-16 01:33:36,151 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8511111111111112 [2020-10-16 01:33:36,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2020-10-16 01:33:36,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2020-10-16 01:33:36,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:36,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2020-10-16 01:33:36,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:33:36,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:33:36,170 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:33:36,172 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 383 transitions. [2020-10-16 01:33:36,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 18 transitions, 56 flow [2020-10-16 01:33:36,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 18 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:36,178 INFO L241 Difference]: Finished difference. Result has 23 places, 16 transitions, 40 flow [2020-10-16 01:33:36,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2020-10-16 01:33:36,182 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:33:36,182 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2020-10-16 01:33:36,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:33:36,183 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:36,183 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:36,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:33:36,183 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:36,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:36,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1324291626, now seen corresponding path program 1 times [2020-10-16 01:33:36,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:36,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993451818] [2020-10-16 01:33:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:36,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993451818] [2020-10-16 01:33:36,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:36,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:33:36,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637319142] [2020-10-16 01:33:36,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:33:36,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:33:36,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:33:36,289 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 150 [2020-10-16 01:33:36,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states. [2020-10-16 01:33:36,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:36,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 150 [2020-10-16 01:33:36,289 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:36,303 INFO L129 PetriNetUnfolder]: 1/18 cut-off events. [2020-10-16 01:33:36,303 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:36,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 24. Up to 5 conditions per place. [2020-10-16 01:33:36,304 INFO L132 encePairwiseOnDemand]: 147/150 looper letters, 1 selfloop transitions, 2 changer transitions 2/17 dead transitions. [2020-10-16 01:33:36,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 52 flow [2020-10-16 01:33:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:33:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:33:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2020-10-16 01:33:36,308 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2020-10-16 01:33:36,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2020-10-16 01:33:36,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2020-10-16 01:33:36,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:36,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2020-10-16 01:33:36,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:33:36,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:33:36,312 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:33:36,312 INFO L185 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 390 transitions. [2020-10-16 01:33:36,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 52 flow [2020-10-16 01:33:36,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 48 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:36,313 INFO L241 Difference]: Finished difference. Result has 24 places, 15 transitions, 42 flow [2020-10-16 01:33:36,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2020-10-16 01:33:36,314 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2020-10-16 01:33:36,314 INFO L481 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 42 flow [2020-10-16 01:33:36,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:33:36,315 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:36,315 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:36,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:33:36,315 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1295394930, now seen corresponding path program 1 times [2020-10-16 01:33:36,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:36,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631515693] [2020-10-16 01:33:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:36,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631515693] [2020-10-16 01:33:36,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:36,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:33:36,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309020583] [2020-10-16 01:33:36,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:33:36,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:33:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:33:36,422 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 150 [2020-10-16 01:33:36,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 42 flow. Second operand 4 states. [2020-10-16 01:33:36,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:36,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 150 [2020-10-16 01:33:36,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:36,486 INFO L129 PetriNetUnfolder]: 6/32 cut-off events. [2020-10-16 01:33:36,487 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:36,487 INFO L80 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 32 events. 6/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 2 based on Foata normal form. 4/35 useless extension candidates. Maximal degree in co-relation 56. Up to 15 conditions per place. [2020-10-16 01:33:36,488 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 4 selfloop transitions, 3 changer transitions 5/22 dead transitions. [2020-10-16 01:33:36,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 80 flow [2020-10-16 01:33:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:33:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:33:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2020-10-16 01:33:36,492 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8386666666666667 [2020-10-16 01:33:36,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2020-10-16 01:33:36,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2020-10-16 01:33:36,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:36,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2020-10-16 01:33:36,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:33:36,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:33:36,498 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:33:36,499 INFO L185 Difference]: Start difference. First operand has 24 places, 15 transitions, 42 flow. Second operand 5 states and 629 transitions. [2020-10-16 01:33:36,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 80 flow [2020-10-16 01:33:36,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:36,500 INFO L241 Difference]: Finished difference. Result has 28 places, 17 transitions, 65 flow [2020-10-16 01:33:36,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=17} [2020-10-16 01:33:36,501 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2020-10-16 01:33:36,501 INFO L481 AbstractCegarLoop]: Abstraction has has 28 places, 17 transitions, 65 flow [2020-10-16 01:33:36,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:33:36,501 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:36,501 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:36,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:33:36,502 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:36,502 INFO L82 PathProgramCache]: Analyzing trace with hash -237169559, now seen corresponding path program 1 times [2020-10-16 01:33:36,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:36,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142292637] [2020-10-16 01:33:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:36,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142292637] [2020-10-16 01:33:36,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:36,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:33:36,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487775788] [2020-10-16 01:33:36,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:33:36,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:33:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:33:36,688 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 150 [2020-10-16 01:33:36,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 17 transitions, 65 flow. Second operand 5 states. [2020-10-16 01:33:36,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:36,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 150 [2020-10-16 01:33:36,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:36,734 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2020-10-16 01:33:36,734 INFO L130 PetriNetUnfolder]: For 15/21 co-relation queries the response was YES. [2020-10-16 01:33:36,734 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 21 events. 2/21 cut-off events. For 15/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 6/27 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2020-10-16 01:33:36,735 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 2 selfloop transitions, 5 changer transitions 3/20 dead transitions. [2020-10-16 01:33:36,735 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 101 flow [2020-10-16 01:33:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:33:36,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:33:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2020-10-16 01:33:36,738 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2020-10-16 01:33:36,738 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2020-10-16 01:33:36,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2020-10-16 01:33:36,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:36,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2020-10-16 01:33:36,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:33:36,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:33:36,743 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:33:36,743 INFO L185 Difference]: Start difference. First operand has 28 places, 17 transitions, 65 flow. Second operand 6 states and 750 transitions. [2020-10-16 01:33:36,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 101 flow [2020-10-16 01:33:36,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 84 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:33:36,745 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 72 flow [2020-10-16 01:33:36,745 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2020-10-16 01:33:36,746 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2020-10-16 01:33:36,746 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 72 flow [2020-10-16 01:33:36,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:33:36,746 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:36,746 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:36,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:33:36,747 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:36,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1926763315, now seen corresponding path program 1 times [2020-10-16 01:33:36,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:36,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960341839] [2020-10-16 01:33:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:36,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960341839] [2020-10-16 01:33:36,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:36,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:33:36,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862382261] [2020-10-16 01:33:36,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:33:36,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:33:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:33:36,803 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 150 [2020-10-16 01:33:36,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 72 flow. Second operand 4 states. [2020-10-16 01:33:36,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:36,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 150 [2020-10-16 01:33:36,804 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:36,826 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2020-10-16 01:33:36,826 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2020-10-16 01:33:36,826 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 27 events. 2/27 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 62. Up to 11 conditions per place. [2020-10-16 01:33:36,827 INFO L132 encePairwiseOnDemand]: 147/150 looper letters, 3 selfloop transitions, 1 changer transitions 1/18 dead transitions. [2020-10-16 01:33:36,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 18 transitions, 84 flow [2020-10-16 01:33:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:33:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:33:36,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2020-10-16 01:33:36,829 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8366666666666667 [2020-10-16 01:33:36,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2020-10-16 01:33:36,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2020-10-16 01:33:36,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:36,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2020-10-16 01:33:36,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:33:36,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:33:36,873 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:33:36,873 INFO L185 Difference]: Start difference. First operand has 31 places, 17 transitions, 72 flow. Second operand 4 states and 502 transitions. [2020-10-16 01:33:36,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 18 transitions, 84 flow [2020-10-16 01:33:36,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 18 transitions, 68 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 01:33:36,876 INFO L241 Difference]: Finished difference. Result has 29 places, 17 transitions, 63 flow [2020-10-16 01:33:36,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2020-10-16 01:33:36,876 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2020-10-16 01:33:36,876 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 63 flow [2020-10-16 01:33:36,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:33:36,876 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:36,877 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:36,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:33:36,877 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1191171369, now seen corresponding path program 2 times [2020-10-16 01:33:36,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:36,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199731741] [2020-10-16 01:33:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:33:36,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:33:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:33:36,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:33:37,020 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:33:37,021 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:33:37,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:33:37,022 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:33:37,035 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L3-->L818: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-309673989 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-309673989 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-309673989 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-309673989 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (or (and .cse0 (or (and .cse1 .cse2 (= ~y~0_Out-309673989 ~y$w_buff1~0_In-309673989)) (and .cse3 (= ~y~0_In-309673989 ~y~0_Out-309673989)))) (and (= ~y$w_buff0~0_In-309673989 ~y~0_Out-309673989) .cse4 .cse5)) (or (and .cse0 (= ~y$w_buff0_used~0_In-309673989 ~y$w_buff0_used~0_Out-309673989)) (and (= ~y$w_buff0_used~0_Out-309673989 0) .cse4 .cse5)) (= ~y$r_buff1_thd0~0_Out-309673989 ~y$r_buff1_thd0~0_In-309673989) (= ~y$r_buff0_thd0~0_Out-309673989 ~y$r_buff0_thd0~0_In-309673989) (or (and .cse3 (= ~y$w_buff1_used~0_Out-309673989 ~y$w_buff1_used~0_In-309673989)) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out-309673989 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-309673989 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-309673989|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-309673989 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-309673989|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-309673989, ~y$w_buff1~0=~y$w_buff1~0_In-309673989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-309673989, ~y$w_buff0~0=~y$w_buff0~0_In-309673989, ~y~0=~y~0_In-309673989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-309673989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-309673989} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-309673989, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-309673989|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-309673989|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-309673989|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-309673989|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-309673989|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-309673989|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-309673989|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-309673989, ~y$w_buff1~0=~y$w_buff1~0_In-309673989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-309673989, ~y$w_buff0~0=~y$w_buff0~0_In-309673989, ~y~0=~y~0_Out-309673989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-309673989, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-309673989} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 01:33:37,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,049 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,049 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:33:37,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:33:37,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:33:37 BasicIcfg [2020-10-16 01:33:37,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:33:37,121 INFO L168 Benchmark]: Toolchain (without parser) took 8458.31 ms. Allocated memory was 249.6 MB in the beginning and 521.7 MB in the end (delta: 272.1 MB). Free memory was 204.0 MB in the beginning and 450.2 MB in the end (delta: -246.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,121 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.11 ms. Allocated memory was 249.6 MB in the beginning and 309.3 MB in the end (delta: 59.8 MB). Free memory was 204.0 MB in the beginning and 262.2 MB in the end (delta: -58.1 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.12 ms. Allocated memory is still 309.3 MB. Free memory was 262.2 MB in the beginning and 259.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,125 INFO L168 Benchmark]: Boogie Preprocessor took 37.26 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 257.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,127 INFO L168 Benchmark]: RCFGBuilder took 1887.69 ms. Allocated memory was 309.3 MB in the beginning and 355.5 MB in the end (delta: 46.1 MB). Free memory was 257.1 MB in the beginning and 233.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:37,128 INFO L168 Benchmark]: TraceAbstraction took 5648.23 ms. Allocated memory was 355.5 MB in the beginning and 521.7 MB in the end (delta: 166.2 MB). Free memory was 233.5 MB in the beginning and 450.2 MB in the end (delta: -216.7 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:33:37,137 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 249.6 MB. Free memory was 227.6 MB in the beginning and 226.8 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 821.11 ms. Allocated memory was 249.6 MB in the beginning and 309.3 MB in the end (delta: 59.8 MB). Free memory was 204.0 MB in the beginning and 262.2 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 59.12 ms. Allocated memory is still 309.3 MB. Free memory was 262.2 MB in the beginning and 259.6 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.26 ms. Allocated memory is still 309.3 MB. Free memory was 259.6 MB in the beginning and 257.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1887.69 ms. Allocated memory was 309.3 MB in the beginning and 355.5 MB in the end (delta: 46.1 MB). Free memory was 257.1 MB in the beginning and 233.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 101.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5648.23 ms. Allocated memory was 355.5 MB in the beginning and 521.7 MB in the end (delta: 166.2 MB). Free memory was 233.5 MB in the beginning and 450.2 MB in the end (delta: -216.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 650 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 5 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 63 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.1s, 82 PlacesBefore, 24 PlacesAfterwards, 77 TransitionsBefore, 17 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, 2089 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L704] 0 int __unbuffered_p1_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff1_thd0; [L717] 0 _Bool y$r_buff1_thd1; [L718] 0 _Bool y$r_buff1_thd2; [L719] 0 _Bool y$read_delayed; [L720] 0 int *y$read_delayed_var; [L721] 0 int y$w_buff0; [L722] 0 _Bool y$w_buff0_used; [L723] 0 int y$w_buff1; [L724] 0 _Bool y$w_buff1_used; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L804] 0 pthread_t t1657; [L805] FCALL, FORK 0 pthread_create(&t1657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1658; [L807] FCALL, FORK 0 pthread_create(&t1658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 2 y$w_buff1 = y$w_buff0 [L763] 2 y$w_buff0 = 1 [L764] 2 y$w_buff1_used = y$w_buff0_used [L765] 2 y$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L767] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L773] 2 z = 1 [L776] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L742] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0 [L742] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L743] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1 [L743] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L746] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = y [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L782] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L783] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L784] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L785] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L786] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5.4s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 17 SDtfs, 7 SDslu, 7 SDs, 0 SdLazy, 52 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...