/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:40,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:40,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:40,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:40,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:40,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:40,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:40,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:40,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:40,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:40,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:40,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:40,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:40,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:40,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:40,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:40,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:40,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:40,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:40,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:40,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:40,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:40,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:40,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:40,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:40,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:40,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:40,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:40,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:40,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:40,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:40,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:40,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:40,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:40,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:40,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:40,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:40,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:40,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:40,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:40,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:40,485 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-SemanticLooper.epf [2020-10-16 04:57:40,510 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:40,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:40,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:40,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:40,512 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:40,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:40,512 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:40,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:40,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:40,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:40,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:40,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:40,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:40,513 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:40,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:40,514 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:40,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:40,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:40,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:40,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:40,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:40,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:40,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:40,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:40,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:40,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:40,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:40,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:40,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:40,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:40,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:40,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:40,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:40,931 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:40,932 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2020-10-16 04:57:41,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71e9cf17/4832d778c84f43ecb32fa89a0daa5adc/FLAG4f743ef49 [2020-10-16 04:57:41,564 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:41,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.oepc.i [2020-10-16 04:57:41,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71e9cf17/4832d778c84f43ecb32fa89a0daa5adc/FLAG4f743ef49 [2020-10-16 04:57:41,830 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71e9cf17/4832d778c84f43ecb32fa89a0daa5adc [2020-10-16 04:57:41,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:41,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:41,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:41,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:41,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:41,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:41" (1/1) ... [2020-10-16 04:57:41,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112c96d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:41, skipping insertion in model container [2020-10-16 04:57:41,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:41" (1/1) ... [2020-10-16 04:57:41,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:41,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:42,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:42,534 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:42,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:42,678 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:42,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42 WrapperNode [2020-10-16 04:57:42,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:42,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:42,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:42,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:42,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:42,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:42,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:42,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:42,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (1/1) ... [2020-10-16 04:57:42,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:42,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:42,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:42,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:42,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (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 04:57:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:42,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:42,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:42,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:42,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:42,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:42,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:42,854 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 04:57:44,528 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:44,528 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:57:44,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:44 BoogieIcfgContainer [2020-10-16 04:57:44,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:44,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:44,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:44,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:44,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:41" (1/3) ... [2020-10-16 04:57:44,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa6ab7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:44, skipping insertion in model container [2020-10-16 04:57:44,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:42" (2/3) ... [2020-10-16 04:57:44,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa6ab7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:44, skipping insertion in model container [2020-10-16 04:57:44,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:44" (3/3) ... [2020-10-16 04:57:44,539 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2020-10-16 04:57:44,550 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:44,557 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:57:44,558 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:44,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,585 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:44,626 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:57:44,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:57:44,647 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:57:44,647 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:57:44,647 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:57:44,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:57:44,647 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:57:44,648 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:57:44,648 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:57:44,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 04:57:44,702 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 04:57:44,702 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:44,707 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 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/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 04:57:44,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 04:57:44,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:44,716 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:57:44,719 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:44,722 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:44,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:44,743 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 04:57:44,743 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:44,744 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 04:57:44,746 INFO L117 LiptonReduction]: Number of co-enabled transitions 936 [2020-10-16 04:57:45,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:45,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:45,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:45,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,038 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 04:57:45,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,041 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 04:57:45,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:45,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:45,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,503 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:57:45,620 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:57:45,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:45,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:45,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:45,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:45,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:45,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:45,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,750 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 04:57:45,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,752 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 04:57:45,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:45,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:45,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:45,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:46,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:46,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:46,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,113 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 04:57:46,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,114 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 04:57:46,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:46,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:46,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:46,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:46,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:46,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:46,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:46,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:46,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:46,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:46,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,542 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 04:57:46,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,544 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 04:57:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:46,836 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:57:46,943 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 04:57:47,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:47,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:47,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:47,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:47,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:47,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:47,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,250 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 04:57:47,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,251 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 04:57:47,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:47,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:47,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:47,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:47,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,346 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 04:57:47,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,347 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 04:57:47,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:47,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:47,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:47,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:47,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:48,000 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:57:48,102 INFO L132 LiptonReduction]: Checked pairs total: 2379 [2020-10-16 04:57:48,103 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 04:57:48,106 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3392 [2020-10-16 04:57:48,122 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2020-10-16 04:57:48,122 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:48,123 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,123 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:57:48,124 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 781438270, now seen corresponding path program 1 times [2020-10-16 04:57:48,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631987914] [2020-10-16 04:57:48,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:48,349 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 04:57:48,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631987914] [2020-10-16 04:57:48,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:48,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:48,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539702360] [2020-10-16 04:57:48,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:48,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:48,377 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 144 [2020-10-16 04:57:48,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 04:57:48,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:48,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 144 [2020-10-16 04:57:48,381 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:48,437 INFO L129 PetriNetUnfolder]: 9/47 cut-off events. [2020-10-16 04:57:48,438 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:48,438 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 47 events. 9/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 1 based on Foata normal form. 6/51 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2020-10-16 04:57:48,440 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 5 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2020-10-16 04:57:48,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 60 flow [2020-10-16 04:57:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2020-10-16 04:57:48,458 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2020-10-16 04:57:48,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2020-10-16 04:57:48,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2020-10-16 04:57:48,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:48,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2020-10-16 04:57:48,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:48,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:48,475 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:48,477 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 376 transitions. [2020-10-16 04:57:48,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 60 flow [2020-10-16 04:57:48,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:48,482 INFO L241 Difference]: Finished difference. Result has 25 places, 18 transitions, 44 flow [2020-10-16 04:57:48,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2020-10-16 04:57:48,486 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 04:57:48,487 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2020-10-16 04:57:48,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:48,487 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,487 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:48,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:57:48,488 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1105080138, now seen corresponding path program 1 times [2020-10-16 04:57:48,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487927456] [2020-10-16 04:57:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:48,609 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 04:57:48,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487927456] [2020-10-16 04:57:48,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:48,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:48,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574296566] [2020-10-16 04:57:48,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:48,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:48,616 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2020-10-16 04:57:48,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand 4 states. [2020-10-16 04:57:48,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:48,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2020-10-16 04:57:48,618 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:48,680 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2020-10-16 04:57:48,681 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:48,681 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 5 conditions per place. [2020-10-16 04:57:48,682 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 2 selfloop transitions, 2 changer transitions 5/22 dead transitions. [2020-10-16 04:57:48,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 70 flow [2020-10-16 04:57:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2020-10-16 04:57:48,690 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2020-10-16 04:57:48,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2020-10-16 04:57:48,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2020-10-16 04:57:48,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:48,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2020-10-16 04:57:48,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:48,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:48,700 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:48,700 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 591 transitions. [2020-10-16 04:57:48,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 70 flow [2020-10-16 04:57:48,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:48,702 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2020-10-16 04:57:48,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 04:57:48,703 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 04:57:48,703 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2020-10-16 04:57:48,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:48,703 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,703 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:48,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:57:48,704 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash 485831526, now seen corresponding path program 1 times [2020-10-16 04:57:48,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885219279] [2020-10-16 04:57:48,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:48,810 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 04:57:48,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885219279] [2020-10-16 04:57:48,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:48,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:48,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398125641] [2020-10-16 04:57:48,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:48,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:48,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:48,814 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2020-10-16 04:57:48,815 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand 4 states. [2020-10-16 04:57:48,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:48,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2020-10-16 04:57:48,815 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:48,841 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2020-10-16 04:57:48,841 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:57:48,842 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 21 events. 0/21 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 2/23 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 04:57:48,842 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 2 selfloop transitions, 2 changer transitions 2/19 dead transitions. [2020-10-16 04:57:48,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 19 transitions, 68 flow [2020-10-16 04:57:48,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2020-10-16 04:57:48,845 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2020-10-16 04:57:48,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2020-10-16 04:57:48,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2020-10-16 04:57:48,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:48,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2020-10-16 04:57:48,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:48,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:48,849 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:48,850 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 5 states and 588 transitions. [2020-10-16 04:57:48,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 19 transitions, 68 flow [2020-10-16 04:57:48,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 60 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:48,851 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:48,851 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 04:57:48,852 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 04:57:48,852 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:48,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:48,852 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,852 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:48,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:57:48,853 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2119152181, now seen corresponding path program 1 times [2020-10-16 04:57:48,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889466645] [2020-10-16 04:57:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:48,930 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 04:57:48,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889466645] [2020-10-16 04:57:48,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:48,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:57:48,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821715926] [2020-10-16 04:57:48,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:48,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:48,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:48,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:48,934 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:48,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 54 flow. Second operand 4 states. [2020-10-16 04:57:48,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:48,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:48,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:48,980 INFO L129 PetriNetUnfolder]: 2/38 cut-off events. [2020-10-16 04:57:48,980 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-16 04:57:48,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 38 events. 2/38 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 94 event pairs, 0 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2020-10-16 04:57:48,981 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 7 selfloop transitions, 2 changer transitions 3/22 dead transitions. [2020-10-16 04:57:48,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 96 flow [2020-10-16 04:57:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2020-10-16 04:57:48,984 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2020-10-16 04:57:48,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2020-10-16 04:57:48,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2020-10-16 04:57:48,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:48,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2020-10-16 04:57:48,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:48,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:48,988 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:48,988 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 54 flow. Second operand 5 states and 584 transitions. [2020-10-16 04:57:48,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 96 flow [2020-10-16 04:57:48,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 79 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:48,990 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:48,990 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 04:57:48,990 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 04:57:48,991 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:48,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:48,991 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,991 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:48,991 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:57:48,991 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1269245410, now seen corresponding path program 1 times [2020-10-16 04:57:48,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063360796] [2020-10-16 04:57:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:49,048 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 04:57:49,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063360796] [2020-10-16 04:57:49,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:49,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:57:49,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656203400] [2020-10-16 04:57:49,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:49,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:49,051 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:49,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 54 flow. Second operand 4 states. [2020-10-16 04:57:49,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:49,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:49,052 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:49,083 INFO L129 PetriNetUnfolder]: 6/36 cut-off events. [2020-10-16 04:57:49,084 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:57:49,084 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 36 events. 6/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 4/38 useless extension candidates. Maximal degree in co-relation 71. Up to 11 conditions per place. [2020-10-16 04:57:49,085 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 5 selfloop transitions, 4 changer transitions 1/22 dead transitions. [2020-10-16 04:57:49,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 84 flow [2020-10-16 04:57:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:57:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:57:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2020-10-16 04:57:49,088 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8125 [2020-10-16 04:57:49,088 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2020-10-16 04:57:49,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2020-10-16 04:57:49,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:49,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2020-10-16 04:57:49,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:57:49,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:57:49,091 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:57:49,091 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 54 flow. Second operand 4 states and 468 transitions. [2020-10-16 04:57:49,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 84 flow [2020-10-16 04:57:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 76 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:49,093 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 72 flow [2020-10-16 04:57:49,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2020-10-16 04:57:49,093 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2020-10-16 04:57:49,094 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 72 flow [2020-10-16 04:57:49,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:49,094 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:49,094 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:49,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:57:49,095 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -106184119, now seen corresponding path program 1 times [2020-10-16 04:57:49,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:49,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965720193] [2020-10-16 04:57:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:49,195 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 04:57:49,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965720193] [2020-10-16 04:57:49,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:49,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:49,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435863993] [2020-10-16 04:57:49,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:49,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:49,199 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2020-10-16 04:57:49,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 72 flow. Second operand 5 states. [2020-10-16 04:57:49,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:49,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2020-10-16 04:57:49,200 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:49,257 INFO L129 PetriNetUnfolder]: 7/50 cut-off events. [2020-10-16 04:57:49,257 INFO L130 PetriNetUnfolder]: For 21/25 co-relation queries the response was YES. [2020-10-16 04:57:49,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 50 events. 7/50 cut-off events. For 21/25 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 2 based on Foata normal form. 4/54 useless extension candidates. Maximal degree in co-relation 122. Up to 21 conditions per place. [2020-10-16 04:57:49,258 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 7 selfloop transitions, 1 changer transitions 3/23 dead transitions. [2020-10-16 04:57:49,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 108 flow [2020-10-16 04:57:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2020-10-16 04:57:49,261 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2020-10-16 04:57:49,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2020-10-16 04:57:49,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2020-10-16 04:57:49,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:49,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2020-10-16 04:57:49,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:49,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:49,265 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:49,266 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 72 flow. Second operand 5 states and 552 transitions. [2020-10-16 04:57:49,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 108 flow [2020-10-16 04:57:49,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 99 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:57:49,268 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 72 flow [2020-10-16 04:57:49,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2020-10-16 04:57:49,268 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2020-10-16 04:57:49,268 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 72 flow [2020-10-16 04:57:49,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:49,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:49,269 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:49,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:57:49,269 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -596400601, now seen corresponding path program 2 times [2020-10-16 04:57:49,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:49,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208094389] [2020-10-16 04:57:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:49,352 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 04:57:49,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208094389] [2020-10-16 04:57:49,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:49,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:49,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033235828] [2020-10-16 04:57:49,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:49,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:49,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:49,355 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:49,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 72 flow. Second operand 5 states. [2020-10-16 04:57:49,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:49,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:49,356 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:49,399 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2020-10-16 04:57:49,400 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-16 04:57:49,400 INFO L80 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 27 events. 2/27 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/31 useless extension candidates. Maximal degree in co-relation 63. Up to 9 conditions per place. [2020-10-16 04:57:49,400 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 1 selfloop transitions, 6 changer transitions 1/20 dead transitions. [2020-10-16 04:57:49,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 20 transitions, 90 flow [2020-10-16 04:57:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2020-10-16 04:57:49,404 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2020-10-16 04:57:49,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2020-10-16 04:57:49,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2020-10-16 04:57:49,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:49,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2020-10-16 04:57:49,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:49,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:49,408 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:49,408 INFO L185 Difference]: Start difference. First operand has 33 places, 19 transitions, 72 flow. Second operand 5 states and 580 transitions. [2020-10-16 04:57:49,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 20 transitions, 90 flow [2020-10-16 04:57:49,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 77 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:49,410 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 82 flow [2020-10-16 04:57:49,410 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2020-10-16 04:57:49,410 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2020-10-16 04:57:49,411 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 82 flow [2020-10-16 04:57:49,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:49,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:49,411 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:49,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:57:49,411 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1471502815, now seen corresponding path program 1 times [2020-10-16 04:57:49,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:49,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630419748] [2020-10-16 04:57:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:49,546 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 04:57:49,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630419748] [2020-10-16 04:57:49,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:49,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:49,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540937970] [2020-10-16 04:57:49,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:49,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:49,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:49,551 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2020-10-16 04:57:49,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 82 flow. Second operand 5 states. [2020-10-16 04:57:49,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:49,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2020-10-16 04:57:49,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:49,596 INFO L129 PetriNetUnfolder]: 2/33 cut-off events. [2020-10-16 04:57:49,596 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-16 04:57:49,597 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 33 events. 2/33 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 84. Up to 12 conditions per place. [2020-10-16 04:57:49,598 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 6 selfloop transitions, 1 changer transitions 2/21 dead transitions. [2020-10-16 04:57:49,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 104 flow [2020-10-16 04:57:49,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 550 transitions. [2020-10-16 04:57:49,600 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2020-10-16 04:57:49,600 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 550 transitions. [2020-10-16 04:57:49,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 550 transitions. [2020-10-16 04:57:49,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:49,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 550 transitions. [2020-10-16 04:57:49,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:49,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:49,605 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:49,605 INFO L185 Difference]: Start difference. First operand has 32 places, 19 transitions, 82 flow. Second operand 5 states and 550 transitions. [2020-10-16 04:57:49,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 104 flow [2020-10-16 04:57:49,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 76 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:49,608 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 63 flow [2020-10-16 04:57:49,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2020-10-16 04:57:49,609 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2020-10-16 04:57:49,609 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 63 flow [2020-10-16 04:57:49,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:49,609 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:49,609 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:49,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:57:49,610 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:49,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1949187931, now seen corresponding path program 2 times [2020-10-16 04:57:49,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:49,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398990455] [2020-10-16 04:57:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:57:49,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:57:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:57:49,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:57:49,823 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:57:49,823 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:57:49,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:57:49,843 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 04:57:49,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,848 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 04:57:49,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,849 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 04:57:49,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,849 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 04:57:49,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,851 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 04:57:49,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,851 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 04:57:49,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,852 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 04:57:49,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,852 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 04:57:49,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,852 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 04:57:49,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,853 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 04:57:49,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,854 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 04:57:49,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,855 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 04:57:49,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,855 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 04:57:49,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,855 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 04:57:49,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,856 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 04:57:49,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,857 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 04:57:49,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,861 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 04:57:49,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,862 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 04:57:49,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,862 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 04:57:49,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,862 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 04:57:49,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:49,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:57:49 BasicIcfg [2020-10-16 04:57:49,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:57:49,960 INFO L168 Benchmark]: Toolchain (without parser) took 8117.45 ms. Allocated memory was 248.5 MB in the beginning and 439.9 MB in the end (delta: 191.4 MB). Free memory was 202.8 MB in the beginning and 156.9 MB in the end (delta: 45.9 MB). Peak memory consumption was 237.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,963 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:57:49,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.01 ms. Allocated memory was 248.5 MB in the beginning and 300.9 MB in the end (delta: 52.4 MB). Free memory was 202.8 MB in the beginning and 251.4 MB in the end (delta: -48.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,965 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 300.9 MB. Free memory was 251.4 MB in the beginning and 248.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,966 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 300.9 MB. Free memory was 248.9 MB in the beginning and 246.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,968 INFO L168 Benchmark]: RCFGBuilder took 1751.32 ms. Allocated memory was 300.9 MB in the beginning and 354.9 MB in the end (delta: 54.0 MB). Free memory was 246.4 MB in the beginning and 239.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,971 INFO L168 Benchmark]: TraceAbstraction took 5426.09 ms. Allocated memory was 354.9 MB in the beginning and 439.9 MB in the end (delta: 84.9 MB). Free memory was 239.8 MB in the beginning and 156.9 MB in the end (delta: 82.9 MB). Peak memory consumption was 167.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:49,979 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.40 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 837.01 ms. Allocated memory was 248.5 MB in the beginning and 300.9 MB in the end (delta: 52.4 MB). Free memory was 202.8 MB in the beginning and 251.4 MB in the end (delta: -48.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 57.78 ms. Allocated memory is still 300.9 MB. Free memory was 251.4 MB in the beginning and 248.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 300.9 MB. Free memory was 248.9 MB in the beginning and 246.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1751.32 ms. Allocated memory was 300.9 MB in the beginning and 354.9 MB in the end (delta: 54.0 MB). Free memory was 246.4 MB in the beginning and 239.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 99.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5426.09 ms. Allocated memory was 354.9 MB in the beginning and 439.9 MB in the end (delta: 84.9 MB). Free memory was 239.8 MB in the beginning and 156.9 MB in the end (delta: 82.9 MB). Peak memory consumption was 167.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 597 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 87 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 81 PlacesBefore, 26 PlacesAfterwards, 76 TransitionsBefore, 20 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2379 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; [L709] 0 _Bool x$flush_delayed; [L710] 0 int x$mem_tmp; [L711] 0 _Bool x$r_buff0_thd0; [L712] 0 _Bool x$r_buff0_thd1; [L713] 0 _Bool x$r_buff0_thd2; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1633; [L803] FCALL, FORK 0 pthread_create(&t1633, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L804] 0 pthread_t t1634; [L805] FCALL, FORK 0 pthread_create(&t1634, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 y = 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 2 __unbuffered_p1_EAX = y 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 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.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 33 SDtfs, 21 SDslu, 35 SDs, 0 SdLazy, 86 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, 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.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 2812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...