/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:24:36,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:24:36,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:24:36,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:24:36,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:24:36,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:24:36,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:24:36,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:24:36,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:24:36,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:24:36,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:24:36,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:24:36,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:24:36,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:24:36,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:24:36,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:24:36,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:24:36,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:24:36,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:24:36,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:24:36,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:24:36,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:24:36,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:24:36,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:24:36,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:24:36,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:24:36,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:24:36,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:24:36,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:24:36,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:24:36,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:24:36,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:24:36,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:24:36,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:24:36,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:24:36,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:24:36,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:24:36,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:24:36,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:24:36,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:24:36,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:24:36,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:24:36,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:24:36,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:24:36,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:24:36,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:24:36,665 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:24:36,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:24:36,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:24:36,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:24:36,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:24:36,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:24:36,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:24:36,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:24:36,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:24:36,667 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:24:36,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:24:36,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:24:36,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:24:36,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:24:36,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:24:36,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:24:36,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:24:36,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:24:36,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:24:36,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:24:36,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:24:36,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:24:36,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:24:36,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:24:36,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:24:36,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:24:37,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:24:37,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:24:37,015 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:24:37,016 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:24:37,016 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.oepc.i [2020-10-16 01:24:37,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3183e0d2/7987fedad1974801b2f02b8a875a5662/FLAG85a46d5fb [2020-10-16 01:24:37,562 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:24:37,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_tso.oepc.i [2020-10-16 01:24:37,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3183e0d2/7987fedad1974801b2f02b8a875a5662/FLAG85a46d5fb [2020-10-16 01:24:37,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3183e0d2/7987fedad1974801b2f02b8a875a5662 [2020-10-16 01:24:37,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:24:37,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:24:37,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:24:37,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:24:37,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:24:37,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:24:37" (1/1) ... [2020-10-16 01:24:37,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d27174f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:37, skipping insertion in model container [2020-10-16 01:24:37,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:24:37" (1/1) ... [2020-10-16 01:24:37,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:24:37,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:24:38,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:24:38,484 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:24:38,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:24:38,660 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:24:38,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38 WrapperNode [2020-10-16 01:24:38,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:24:38,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:24:38,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:24:38,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:24:38,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:24:38,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:24:38,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:24:38,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:24:38,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... [2020-10-16 01:24:38,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:24:38,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:24:38,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:24:38,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:24:38,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:24:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:24:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:24:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:24:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:24:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:24:38,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:24:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:24:38,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:24:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:24:38,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:24:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:24:38,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:24:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:24:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:24:38,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:24:38,844 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:24:41,382 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:24:41,382 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:24:41,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:24:41 BoogieIcfgContainer [2020-10-16 01:24:41,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:24:41,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:24:41,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:24:41,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:24:41,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:24:37" (1/3) ... [2020-10-16 01:24:41,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb995dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:24:41, skipping insertion in model container [2020-10-16 01:24:41,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:24:38" (2/3) ... [2020-10-16 01:24:41,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb995dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:24:41, skipping insertion in model container [2020-10-16 01:24:41,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:24:41" (3/3) ... [2020-10-16 01:24:41,393 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_tso.oepc.i [2020-10-16 01:24:41,405 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:24:41,413 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:24:41,415 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:24:41,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,460 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,460 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,468 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,488 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,488 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,491 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,491 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,492 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,492 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,493 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,494 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,495 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,496 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,497 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:24:41,517 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:24:41,539 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:24:41,539 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:24:41,539 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:24:41,539 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:24:41,539 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:24:41,540 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:24:41,540 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:24:41,540 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:24:41,554 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2020-10-16 01:24:41,609 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2020-10-16 01:24:41,609 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:24:41,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 01:24:41,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2020-10-16 01:24:41,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2020-10-16 01:24:41,624 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:24:41,627 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2020-10-16 01:24:41,630 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2020-10-16 01:24:41,630 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2020-10-16 01:24:41,655 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2020-10-16 01:24:41,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:24:41,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-16 01:24:41,661 INFO L117 LiptonReduction]: Number of co-enabled transitions 2814 [2020-10-16 01:24:41,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:41,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:41,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:41,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:41,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:41,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:41,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:41,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:41,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:41,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:41,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:41,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:41,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:41,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:41,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:41,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:41,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:41,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:24:41,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:24:41,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:42,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:24:42,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:42,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:42,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:42,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:24:42,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:42,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:24:42,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:42,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:42,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:42,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:42,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:42,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,535 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 01:24:42,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:42,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:42,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:42,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:42,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:43,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:43,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:43,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:24:43,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:24:43,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:43,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:43,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:43,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:24:43,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:24:43,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:24:43,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:24:43,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:43,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:43,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:43,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:43,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:43,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:43,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:43,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:43,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:24:43,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:43,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:24:43,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:44,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:44,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:44,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:44,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:44,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:44,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:44,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:44,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:44,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:44,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:44,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:44,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:44,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:24:44,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:44,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:24:44,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:24:44,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:24:44,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:24:45,004 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-10-16 01:24:45,157 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-16 01:24:45,168 INFO L132 LiptonReduction]: Checked pairs total: 7682 [2020-10-16 01:24:45,168 INFO L134 LiptonReduction]: Total number of compositions: 91 [2020-10-16 01:24:45,187 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3565 [2020-10-16 01:24:45,199 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 01:24:45,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:24:45,199 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:45,200 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:24:45,200 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1205404, now seen corresponding path program 1 times [2020-10-16 01:24:45,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:45,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300063906] [2020-10-16 01:24:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:45,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300063906] [2020-10-16 01:24:45,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:45,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:24:45,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447387092] [2020-10-16 01:24:45,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:24:45,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:24:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:24:45,493 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 207 [2020-10-16 01:24:45,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states. [2020-10-16 01:24:45,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:45,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 207 [2020-10-16 01:24:45,506 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:45,653 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2020-10-16 01:24:45,653 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:24:45,655 INFO L80 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 316 events. 133/316 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1691 event pairs, 110 based on Foata normal form. 33/321 useless extension candidates. Maximal degree in co-relation 524. Up to 153 conditions per place. [2020-10-16 01:24:45,659 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2020-10-16 01:24:45,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2020-10-16 01:24:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:24:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:24:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2020-10-16 01:24:45,678 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9098228663446055 [2020-10-16 01:24:45,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 565 transitions. [2020-10-16 01:24:45,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 565 transitions. [2020-10-16 01:24:45,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:45,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 565 transitions. [2020-10-16 01:24:45,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:24:45,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:24:45,701 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:24:45,703 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 565 transitions. [2020-10-16 01:24:45,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2020-10-16 01:24:45,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:24:45,709 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2020-10-16 01:24:45,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 01:24:45,713 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2020-10-16 01:24:45,713 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2020-10-16 01:24:45,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:24:45,714 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:45,714 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:45,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:24:45,714 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1422340412, now seen corresponding path program 1 times [2020-10-16 01:24:45,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:45,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699989006] [2020-10-16 01:24:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:45,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699989006] [2020-10-16 01:24:45,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:45,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:24:45,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7948914] [2020-10-16 01:24:45,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:24:45,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:45,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:24:45,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:24:45,828 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 207 [2020-10-16 01:24:45,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 01:24:45,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:45,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 207 [2020-10-16 01:24:45,829 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:45,908 INFO L129 PetriNetUnfolder]: 45/136 cut-off events. [2020-10-16 01:24:45,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:24:45,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 136 events. 45/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 595 event pairs, 23 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 216. Up to 76 conditions per place. [2020-10-16 01:24:45,913 INFO L132 encePairwiseOnDemand]: 201/207 looper letters, 5 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2020-10-16 01:24:45,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 100 flow [2020-10-16 01:24:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:24:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:24:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2020-10-16 01:24:45,916 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8727858293075684 [2020-10-16 01:24:45,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 542 transitions. [2020-10-16 01:24:45,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 542 transitions. [2020-10-16 01:24:45,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:45,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 542 transitions. [2020-10-16 01:24:45,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:24:45,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:24:45,921 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:24:45,921 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states and 542 transitions. [2020-10-16 01:24:45,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 100 flow [2020-10-16 01:24:45,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:24:45,923 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 101 flow [2020-10-16 01:24:45,923 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2020-10-16 01:24:45,924 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2020-10-16 01:24:45,924 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 101 flow [2020-10-16 01:24:45,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:24:45,924 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:45,924 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:45,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:24:45,925 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2122734715, now seen corresponding path program 1 times [2020-10-16 01:24:45,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:45,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471813961] [2020-10-16 01:24:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:46,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471813961] [2020-10-16 01:24:46,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:46,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:24:46,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68644780] [2020-10-16 01:24:46,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:24:46,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:24:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:24:46,091 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 207 [2020-10-16 01:24:46,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 101 flow. Second operand 4 states. [2020-10-16 01:24:46,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:46,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 207 [2020-10-16 01:24:46,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:46,155 INFO L129 PetriNetUnfolder]: 33/120 cut-off events. [2020-10-16 01:24:46,156 INFO L130 PetriNetUnfolder]: For 12/41 co-relation queries the response was YES. [2020-10-16 01:24:46,157 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 120 events. 33/120 cut-off events. For 12/41 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 441 event pairs, 7 based on Foata normal form. 12/119 useless extension candidates. Maximal degree in co-relation 246. Up to 60 conditions per place. [2020-10-16 01:24:46,158 INFO L132 encePairwiseOnDemand]: 201/207 looper letters, 5 selfloop transitions, 9 changer transitions 0/38 dead transitions. [2020-10-16 01:24:46,158 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 145 flow [2020-10-16 01:24:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:24:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:24:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2020-10-16 01:24:46,162 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8731884057971014 [2020-10-16 01:24:46,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 723 transitions. [2020-10-16 01:24:46,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 723 transitions. [2020-10-16 01:24:46,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:46,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 723 transitions. [2020-10-16 01:24:46,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:24:46,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:24:46,168 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:24:46,168 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 101 flow. Second operand 4 states and 723 transitions. [2020-10-16 01:24:46,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 145 flow [2020-10-16 01:24:46,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:24:46,170 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 148 flow [2020-10-16 01:24:46,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2020-10-16 01:24:46,171 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2020-10-16 01:24:46,171 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 148 flow [2020-10-16 01:24:46,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:24:46,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:46,172 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:46,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:24:46,172 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2078338931, now seen corresponding path program 1 times [2020-10-16 01:24:46,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:46,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108374067] [2020-10-16 01:24:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:46,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108374067] [2020-10-16 01:24:46,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:46,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:24:46,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611600095] [2020-10-16 01:24:46,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:24:46,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:24:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:24:46,300 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 207 [2020-10-16 01:24:46,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 148 flow. Second operand 5 states. [2020-10-16 01:24:46,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:46,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 207 [2020-10-16 01:24:46,301 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:46,346 INFO L129 PetriNetUnfolder]: 21/82 cut-off events. [2020-10-16 01:24:46,347 INFO L130 PetriNetUnfolder]: For 52/121 co-relation queries the response was YES. [2020-10-16 01:24:46,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 82 events. 21/82 cut-off events. For 52/121 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 1 based on Foata normal form. 22/96 useless extension candidates. Maximal degree in co-relation 221. Up to 42 conditions per place. [2020-10-16 01:24:46,348 INFO L132 encePairwiseOnDemand]: 201/207 looper letters, 5 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2020-10-16 01:24:46,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 208 flow [2020-10-16 01:24:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:24:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:24:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2020-10-16 01:24:46,352 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8734299516908213 [2020-10-16 01:24:46,352 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2020-10-16 01:24:46,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2020-10-16 01:24:46,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:46,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2020-10-16 01:24:46,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:24:46,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:24:46,357 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:24:46,357 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 148 flow. Second operand 5 states and 904 transitions. [2020-10-16 01:24:46,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 208 flow [2020-10-16 01:24:46,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 190 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 01:24:46,360 INFO L241 Difference]: Finished difference. Result has 48 places, 42 transitions, 198 flow [2020-10-16 01:24:46,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2020-10-16 01:24:46,361 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2020-10-16 01:24:46,361 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 198 flow [2020-10-16 01:24:46,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:24:46,361 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:46,361 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:46,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:24:46,362 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:46,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1576482447, now seen corresponding path program 1 times [2020-10-16 01:24:46,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:46,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077786540] [2020-10-16 01:24:46,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:46,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077786540] [2020-10-16 01:24:46,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:46,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:24:46,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978945996] [2020-10-16 01:24:46,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:24:46,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:24:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:24:46,437 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 207 [2020-10-16 01:24:46,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 198 flow. Second operand 6 states. [2020-10-16 01:24:46,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:46,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 207 [2020-10-16 01:24:46,439 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:46,489 INFO L129 PetriNetUnfolder]: 17/58 cut-off events. [2020-10-16 01:24:46,489 INFO L130 PetriNetUnfolder]: For 108/184 co-relation queries the response was YES. [2020-10-16 01:24:46,490 INFO L80 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 58 events. 17/58 cut-off events. For 108/184 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 115 event pairs, 0 based on Foata normal form. 23/77 useless extension candidates. Maximal degree in co-relation 194. Up to 30 conditions per place. [2020-10-16 01:24:46,490 INFO L132 encePairwiseOnDemand]: 201/207 looper letters, 1 selfloop transitions, 17 changer transitions 1/42 dead transitions. [2020-10-16 01:24:46,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 234 flow [2020-10-16 01:24:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:24:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:24:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1081 transitions. [2020-10-16 01:24:46,494 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2020-10-16 01:24:46,494 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1081 transitions. [2020-10-16 01:24:46,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1081 transitions. [2020-10-16 01:24:46,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:46,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1081 transitions. [2020-10-16 01:24:46,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:24:46,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:24:46,501 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:24:46,501 INFO L185 Difference]: Start difference. First operand has 48 places, 42 transitions, 198 flow. Second operand 6 states and 1081 transitions. [2020-10-16 01:24:46,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 234 flow [2020-10-16 01:24:46,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 200 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:24:46,504 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2020-10-16 01:24:46,504 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2020-10-16 01:24:46,505 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2020-10-16 01:24:46,505 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2020-10-16 01:24:46,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:24:46,505 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:46,505 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:46,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:24:46,505 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash 218128182, now seen corresponding path program 1 times [2020-10-16 01:24:46,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:46,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360021785] [2020-10-16 01:24:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:46,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360021785] [2020-10-16 01:24:46,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:46,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:24:46,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720900475] [2020-10-16 01:24:46,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:24:46,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:24:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:24:47,000 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 207 [2020-10-16 01:24:47,001 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand 8 states. [2020-10-16 01:24:47,001 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:47,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 207 [2020-10-16 01:24:47,002 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:47,353 INFO L129 PetriNetUnfolder]: 175/394 cut-off events. [2020-10-16 01:24:47,353 INFO L130 PetriNetUnfolder]: For 499/596 co-relation queries the response was YES. [2020-10-16 01:24:47,356 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 394 events. 175/394 cut-off events. For 499/596 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2120 event pairs, 14 based on Foata normal form. 2/364 useless extension candidates. Maximal degree in co-relation 1178. Up to 118 conditions per place. [2020-10-16 01:24:47,359 INFO L132 encePairwiseOnDemand]: 199/207 looper letters, 22 selfloop transitions, 7 changer transitions 2/62 dead transitions. [2020-10-16 01:24:47,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 310 flow [2020-10-16 01:24:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:24:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:24:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions. [2020-10-16 01:24:47,364 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7612146307798482 [2020-10-16 01:24:47,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions. [2020-10-16 01:24:47,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions. [2020-10-16 01:24:47,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:47,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions. [2020-10-16 01:24:47,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:24:47,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:24:47,372 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:24:47,372 INFO L185 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 7 states and 1103 transitions. [2020-10-16 01:24:47,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 310 flow [2020-10-16 01:24:47,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 260 flow, removed 12 selfloop flow, removed 4 redundant places. [2020-10-16 01:24:47,382 INFO L241 Difference]: Finished difference. Result has 56 places, 46 transitions, 202 flow [2020-10-16 01:24:47,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2020-10-16 01:24:47,383 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2020-10-16 01:24:47,383 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 202 flow [2020-10-16 01:24:47,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:24:47,383 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:47,383 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:47,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:24:47,384 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -350325274, now seen corresponding path program 2 times [2020-10-16 01:24:47,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:47,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765208822] [2020-10-16 01:24:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:47,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765208822] [2020-10-16 01:24:47,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:47,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:24:47,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907619707] [2020-10-16 01:24:47,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:24:47,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:24:47,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:24:47,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2020-10-16 01:24:47,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 202 flow. Second operand 5 states. [2020-10-16 01:24:47,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:47,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2020-10-16 01:24:47,499 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:47,615 INFO L129 PetriNetUnfolder]: 185/424 cut-off events. [2020-10-16 01:24:47,615 INFO L130 PetriNetUnfolder]: For 340/356 co-relation queries the response was YES. [2020-10-16 01:24:47,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 424 events. 185/424 cut-off events. For 340/356 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2520 event pairs, 17 based on Foata normal form. 3/369 useless extension candidates. Maximal degree in co-relation 1154. Up to 137 conditions per place. [2020-10-16 01:24:47,621 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 4 selfloop transitions, 2 changer transitions 1/48 dead transitions. [2020-10-16 01:24:47,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 222 flow [2020-10-16 01:24:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:24:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:24:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 868 transitions. [2020-10-16 01:24:47,624 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8386473429951691 [2020-10-16 01:24:47,625 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 868 transitions. [2020-10-16 01:24:47,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 868 transitions. [2020-10-16 01:24:47,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:47,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 868 transitions. [2020-10-16 01:24:47,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:24:47,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:24:47,629 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:24:47,630 INFO L185 Difference]: Start difference. First operand has 56 places, 46 transitions, 202 flow. Second operand 5 states and 868 transitions. [2020-10-16 01:24:47,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 222 flow [2020-10-16 01:24:47,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 214 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:24:47,638 INFO L241 Difference]: Finished difference. Result has 59 places, 47 transitions, 209 flow [2020-10-16 01:24:47,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2020-10-16 01:24:47,639 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2020-10-16 01:24:47,639 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 209 flow [2020-10-16 01:24:47,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:24:47,639 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:47,639 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:47,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:24:47,640 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1949048438, now seen corresponding path program 3 times [2020-10-16 01:24:47,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:47,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070373791] [2020-10-16 01:24:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:47,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070373791] [2020-10-16 01:24:47,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:47,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:24:47,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558915781] [2020-10-16 01:24:47,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:24:47,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:47,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:24:47,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:24:47,732 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 207 [2020-10-16 01:24:47,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 209 flow. Second operand 5 states. [2020-10-16 01:24:47,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:47,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 207 [2020-10-16 01:24:47,733 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:47,889 INFO L129 PetriNetUnfolder]: 361/786 cut-off events. [2020-10-16 01:24:47,889 INFO L130 PetriNetUnfolder]: For 653/685 co-relation queries the response was YES. [2020-10-16 01:24:47,895 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 786 events. 361/786 cut-off events. For 653/685 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 5373 event pairs, 32 based on Foata normal form. 3/648 useless extension candidates. Maximal degree in co-relation 2151. Up to 265 conditions per place. [2020-10-16 01:24:47,898 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 4 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2020-10-16 01:24:47,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 231 flow [2020-10-16 01:24:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:24:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:24:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2020-10-16 01:24:47,902 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2020-10-16 01:24:47,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2020-10-16 01:24:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2020-10-16 01:24:47,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:47,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2020-10-16 01:24:47,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:24:47,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:24:47,908 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:24:47,908 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 209 flow. Second operand 5 states and 873 transitions. [2020-10-16 01:24:47,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 231 flow [2020-10-16 01:24:47,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:24:47,928 INFO L241 Difference]: Finished difference. Result has 63 places, 47 transitions, 215 flow [2020-10-16 01:24:47,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2020-10-16 01:24:47,928 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2020-10-16 01:24:47,929 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 215 flow [2020-10-16 01:24:47,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:24:47,929 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:47,929 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:47,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:24:47,929 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:47,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1270409348, now seen corresponding path program 4 times [2020-10-16 01:24:47,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:47,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605721176] [2020-10-16 01:24:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:24:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:24:48,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605721176] [2020-10-16 01:24:48,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:24:48,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:24:48,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395037581] [2020-10-16 01:24:48,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:24:48,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:24:48,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:24:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:24:48,006 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 207 [2020-10-16 01:24:48,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 215 flow. Second operand 5 states. [2020-10-16 01:24:48,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:24:48,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 207 [2020-10-16 01:24:48,007 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:24:48,202 INFO L129 PetriNetUnfolder]: 563/1219 cut-off events. [2020-10-16 01:24:48,202 INFO L130 PetriNetUnfolder]: For 1003/1032 co-relation queries the response was YES. [2020-10-16 01:24:48,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 1219 events. 563/1219 cut-off events. For 1003/1032 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 9267 event pairs, 57 based on Foata normal form. 3/1021 useless extension candidates. Maximal degree in co-relation 3351. Up to 422 conditions per place. [2020-10-16 01:24:48,218 INFO L132 encePairwiseOnDemand]: 203/207 looper letters, 4 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2020-10-16 01:24:48,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 239 flow [2020-10-16 01:24:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:24:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:24:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 873 transitions. [2020-10-16 01:24:48,222 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2020-10-16 01:24:48,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 873 transitions. [2020-10-16 01:24:48,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 873 transitions. [2020-10-16 01:24:48,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:24:48,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 873 transitions. [2020-10-16 01:24:48,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:24:48,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:24:48,228 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:24:48,228 INFO L185 Difference]: Start difference. First operand has 63 places, 47 transitions, 215 flow. Second operand 5 states and 873 transitions. [2020-10-16 01:24:48,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 239 flow [2020-10-16 01:24:48,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 49 transitions, 232 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:24:48,282 INFO L241 Difference]: Finished difference. Result has 65 places, 44 transitions, 203 flow [2020-10-16 01:24:48,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2020-10-16 01:24:48,283 INFO L342 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2020-10-16 01:24:48,283 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 203 flow [2020-10-16 01:24:48,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:24:48,283 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:24:48,284 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:24:48,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:24:48,284 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:24:48,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:24:48,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1665578516, now seen corresponding path program 5 times [2020-10-16 01:24:48,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:24:48,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729790791] [2020-10-16 01:24:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:24:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:24:48,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:24:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:24:48,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:24:48,583 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:24:48,583 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:24:48,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:24:48,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,640 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,640 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,640 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,641 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,642 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,642 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,642 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,643 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,643 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,643 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,644 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,644 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,645 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,645 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,645 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,652 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,653 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,654 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,655 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,656 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,657 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,658 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,659 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,660 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,660 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:24:48,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:24:48,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:24:48 BasicIcfg [2020-10-16 01:24:48,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:24:48,806 INFO L168 Benchmark]: Toolchain (without parser) took 10896.99 ms. Allocated memory was 252.2 MB in the beginning and 518.0 MB in the end (delta: 265.8 MB). Free memory was 205.4 MB in the beginning and 165.5 MB in the end (delta: 39.8 MB). Peak memory consumption was 305.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,807 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.96 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 205.4 MB in the beginning and 266.2 MB in the end (delta: -60.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 317.2 MB. Free memory was 266.2 MB in the beginning and 263.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,811 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 ms. Allocated memory is still 317.2 MB. Free memory was 263.7 MB in the beginning and 261.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,815 INFO L168 Benchmark]: RCFGBuilder took 2621.61 ms. Allocated memory was 317.2 MB in the beginning and 371.7 MB in the end (delta: 54.5 MB). Free memory was 261.2 MB in the beginning and 333.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 142.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,818 INFO L168 Benchmark]: TraceAbstraction took 7415.93 ms. Allocated memory was 371.7 MB in the beginning and 518.0 MB in the end (delta: 146.3 MB). Free memory was 333.9 MB in the beginning and 165.5 MB in the end (delta: 168.4 MB). Peak memory consumption was 314.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:24:48,826 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 252.2 MB. Free memory was 227.7 MB in the beginning and 226.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 751.96 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 205.4 MB in the beginning and 266.2 MB in the end (delta: -60.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 317.2 MB. Free memory was 266.2 MB in the beginning and 263.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.93 ms. Allocated memory is still 317.2 MB. Free memory was 263.7 MB in the beginning and 261.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2621.61 ms. Allocated memory was 317.2 MB in the beginning and 371.7 MB in the end (delta: 54.5 MB). Free memory was 261.2 MB in the beginning and 333.9 MB in the end (delta: -72.7 MB). Peak memory consumption was 142.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7415.93 ms. Allocated memory was 371.7 MB in the beginning and 518.0 MB in the end (delta: 146.3 MB). Free memory was 333.9 MB in the beginning and 165.5 MB in the end (delta: 168.4 MB). Peak memory consumption was 314.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1936 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 327 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 123 PlacesBefore, 44 PlacesAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2814 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7682 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L713] 0 int b = 0; [L714] 0 _Bool b$flush_delayed; [L715] 0 int b$mem_tmp; [L716] 0 _Bool b$r_buff0_thd0; [L717] 0 _Bool b$r_buff0_thd1; [L718] 0 _Bool b$r_buff0_thd2; [L719] 0 _Bool b$r_buff0_thd3; [L720] 0 _Bool b$r_buff0_thd4; [L721] 0 _Bool b$r_buff1_thd0; [L722] 0 _Bool b$r_buff1_thd1; [L723] 0 _Bool b$r_buff1_thd2; [L724] 0 _Bool b$r_buff1_thd3; [L725] 0 _Bool b$r_buff1_thd4; [L726] 0 _Bool b$read_delayed; [L727] 0 int *b$read_delayed_var; [L728] 0 int b$w_buff0; [L729] 0 _Bool b$w_buff0_used; [L730] 0 int b$w_buff1; [L731] 0 _Bool b$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L862] 0 pthread_t t961; [L863] FCALL, FORK 0 pthread_create(&t961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t962; [L865] FCALL, FORK 0 pthread_create(&t962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t963; [L867] FCALL, FORK 0 pthread_create(&t963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 b$w_buff1 = b$w_buff0 [L746] 1 b$w_buff0 = 1 [L747] 1 b$w_buff1_used = b$w_buff0_used [L748] 1 b$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L750] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L751] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L752] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L753] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L754] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L755] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L775] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L795] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L868] 0 pthread_t t964; [L869] FCALL, FORK 0 pthread_create(&t964, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L815] 4 z = 1 [L818] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 b$flush_delayed = weak$$choice2 [L827] 4 b$mem_tmp = b [L828] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L828] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L829] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L829] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L830] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L830] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L831] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L831] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L831] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L831] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L831] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L831] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L832] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L833] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L834] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = b [L836] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L836] 4 b = b$flush_delayed ? b$mem_tmp : b [L837] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1] [L781] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L781] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L781] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L781] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L782] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L783] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L784] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L784] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L785] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L785] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L761] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L761] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L762] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L762] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L763] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L763] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L764] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L764] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L765] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L765] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L768] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L770] 1 return 0; [L801] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L801] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L802] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L802] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L803] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L803] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L804] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L804] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L805] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L805] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L840] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L840] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L840] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L840] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L841] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L841] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L842] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L842] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L843] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L843] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L844] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L844] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1] [L875] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L875] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L876] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L876] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L877] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L877] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L878] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L878] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L879] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L879] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 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: 7.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 36 SDtfs, 18 SDslu, 26 SDs, 0 SdLazy, 228 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=8, 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.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 22520 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...