/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:45:27,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:45:27,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:45:27,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:45:27,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:45:27,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:45:27,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:45:27,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:45:27,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:45:27,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:45:27,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:45:27,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:45:27,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:45:27,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:45:27,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:45:27,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:45:27,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:45:27,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:45:27,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:45:27,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:45:27,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:45:27,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:45:27,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:45:27,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:45:27,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:45:27,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:45:27,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:45:27,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:45:27,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:45:27,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:45:27,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:45:27,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:45:27,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:45:27,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:45:27,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:45:27,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:45:27,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:45:27,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:45:27,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:45:27,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:45:27,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:45:27,568 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:45:27,608 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:45:27,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:45:27,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:45:27,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:45:27,612 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:45:27,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:45:27,613 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:45:27,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:45:27,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:45:27,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:45:27,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:45:27,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:45:27,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:45:27,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:45:27,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:45:27,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:45:27,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:45:27,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:45:27,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:45:27,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:45:27,617 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:45:27,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:45:27,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:45:27,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:45:27,969 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:45:27,969 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:45:27,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin001_rmo.opt.i [2021-03-26 10:45:28,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4a0df1a/9c38b412137542da937b8b8e73ce6437/FLAG56dac60f2 [2021-03-26 10:45:28,672 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:45:28,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin001_rmo.opt.i [2021-03-26 10:45:28,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4a0df1a/9c38b412137542da937b8b8e73ce6437/FLAG56dac60f2 [2021-03-26 10:45:29,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4a0df1a/9c38b412137542da937b8b8e73ce6437 [2021-03-26 10:45:29,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:45:29,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:45:29,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:45:29,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:45:29,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:45:29,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6d1ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29, skipping insertion in model container [2021-03-26 10:45:29,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:45:29,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:45:29,288 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin001_rmo.opt.i[992,1005] [2021-03-26 10:45:29,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:45:29,457 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:45:29,476 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin001_rmo.opt.i[992,1005] [2021-03-26 10:45:29,519 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:45:29,574 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:45:29,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29 WrapperNode [2021-03-26 10:45:29,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:45:29,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:45:29,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:45:29,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:45:29,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:45:29,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:45:29,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:45:29,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:45:29,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... [2021-03-26 10:45:29,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:45:29,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:45:29,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:45:29,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:45:29,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:45:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 10:45:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:45:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:45:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:45:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:45:29,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:45:29,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:45:29,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:45:29,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:45:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:45:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:45:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:45:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:45:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:45:29,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:45:29,734 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:45:31,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:45:31,550 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 10:45:31,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:45:31 BoogieIcfgContainer [2021-03-26 10:45:31,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:45:31,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:45:31,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:45:31,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:45:31,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:45:29" (1/3) ... [2021-03-26 10:45:31,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7b0560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:45:31, skipping insertion in model container [2021-03-26 10:45:31,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:45:29" (2/3) ... [2021-03-26 10:45:31,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7b0560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:45:31, skipping insertion in model container [2021-03-26 10:45:31,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:45:31" (3/3) ... [2021-03-26 10:45:31,561 INFO L111 eAbstractionObserver]: Analyzing ICFG thin001_rmo.opt.i [2021-03-26 10:45:31,568 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:45:31,573 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 10:45:31,573 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:45:31,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,619 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,619 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,654 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:45:31,673 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:45:31,690 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-26 10:45:31,717 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:45:31,717 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:45:31,717 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:45:31,717 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:45:31,718 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:45:31,718 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:45:31,718 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:45:31,718 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:45:31,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-03-26 10:45:31,769 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 10:45:31,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:45:31,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-03-26 10:45:31,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-03-26 10:45:31,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 99 transitions, 207 flow [2021-03-26 10:45:31,779 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:31,793 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-26 10:45:31,795 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-26 10:45:31,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 99 transitions, 207 flow [2021-03-26 10:45:31,815 INFO L129 PetriNetUnfolder]: 1/99 cut-off events. [2021-03-26 10:45:31,816 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:45:31,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 1/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 10:45:31,819 INFO L142 LiptonReduction]: Number of co-enabled transitions 954 [2021-03-26 10:45:34,545 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 10:45:35,090 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 10:45:35,229 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:45:36,183 WARN L205 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-26 10:45:36,569 WARN L205 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-26 10:45:38,137 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 322 DAG size of output: 277 [2021-03-26 10:45:38,872 WARN L205 SmtUtils]: Spent 732.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-03-26 10:45:40,588 INFO L154 LiptonReduction]: Checked pairs total: 1446 [2021-03-26 10:45:40,588 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-26 10:45:40,591 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8813 [2021-03-26 10:45:40,603 INFO L129 PetriNetUnfolder]: 1/38 cut-off events. [2021-03-26 10:45:40,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:45:40,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:40,605 INFO L263 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] [2021-03-26 10:45:40,605 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash 529741085, now seen corresponding path program 1 times [2021-03-26 10:45:40,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:40,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680672425] [2021-03-26 10:45:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:40,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:40,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:40,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:40,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:40,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680672425] [2021-03-26 10:45:40,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:40,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:45:40,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426938586] [2021-03-26 10:45:41,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:45:41,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:41,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:45:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:45:41,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 176 [2021-03-26 10:45:41,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:41,027 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:41,027 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 176 [2021-03-26 10:45:41,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:41,062 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 10:45:41,062 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:45:41,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:41,063 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-26 10:45:41,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 89 flow [2021-03-26 10:45:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:45:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:45:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2021-03-26 10:45:41,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9431818181818182 [2021-03-26 10:45:41,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2021-03-26 10:45:41,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2021-03-26 10:45:41,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:41,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2021-03-26 10:45:41,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:41,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:41,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:41,096 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 498 transitions. [2021-03-26 10:45:41,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 89 flow [2021-03-26 10:45:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:45:41,101 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 88 flow [2021-03-26 10:45:41,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-26 10:45:41,103 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-26 10:45:41,103 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:41,103 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 88 flow [2021-03-26 10:45:41,104 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 88 flow [2021-03-26 10:45:41,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 88 flow [2021-03-26 10:45:41,109 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 10:45:41,109 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:45:41,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 0/37 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:41,109 INFO L142 LiptonReduction]: Number of co-enabled transitions 180 [2021-03-26 10:45:41,415 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-03-26 10:45:42,600 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-03-26 10:45:43,033 INFO L154 LiptonReduction]: Checked pairs total: 893 [2021-03-26 10:45:43,033 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 10:45:43,034 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1931 [2021-03-26 10:45:43,035 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-26 10:45:43,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:43,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:43,035 INFO L263 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] [2021-03-26 10:45:43,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:45:43,036 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1941577565, now seen corresponding path program 1 times [2021-03-26 10:45:43,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:43,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848545761] [2021-03-26 10:45:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:43,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:43,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:43,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:43,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:43,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:43,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:43,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848545761] [2021-03-26 10:45:43,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:43,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:45:43,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586489853] [2021-03-26 10:45:43,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:45:43,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:45:43,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:45:43,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 191 [2021-03-26 10:45:43,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:43,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:43,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 191 [2021-03-26 10:45:43,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:43,137 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-26 10:45:43,137 INFO L130 PetriNetUnfolder]: For 8/15 co-relation queries the response was YES. [2021-03-26 10:45:43,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 27 events. 0/27 cut-off events. For 8/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 2/29 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:45:43,137 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-26 10:45:43,137 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 73 flow [2021-03-26 10:45:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:45:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:45:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 683 transitions. [2021-03-26 10:45:43,141 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.893979057591623 [2021-03-26 10:45:43,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 683 transitions. [2021-03-26 10:45:43,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 683 transitions. [2021-03-26 10:45:43,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:43,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 683 transitions. [2021-03-26 10:45:43,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:43,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:43,147 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:43,147 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 683 transitions. [2021-03-26 10:45:43,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 73 flow [2021-03-26 10:45:43,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:45:43,148 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 68 flow [2021-03-26 10:45:43,148 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-26 10:45:43,149 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-26 10:45:43,149 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:43,149 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 68 flow [2021-03-26 10:45:43,150 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 68 flow [2021-03-26 10:45:43,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 68 flow [2021-03-26 10:45:43,154 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 10:45:43,154 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 10:45:43,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:43,155 INFO L142 LiptonReduction]: Number of co-enabled transitions 144 [2021-03-26 10:45:43,509 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-26 10:45:43,865 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-26 10:45:44,736 WARN L205 SmtUtils]: Spent 869.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:45:45,445 WARN L205 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-26 10:45:45,879 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:45:46,012 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:45:46,147 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:45:46,272 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:45:50,855 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 161 [2021-03-26 10:45:51,209 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-26 10:45:51,883 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 161 [2021-03-26 10:45:52,174 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-26 10:45:52,177 INFO L154 LiptonReduction]: Checked pairs total: 372 [2021-03-26 10:45:52,177 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:45:52,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9029 [2021-03-26 10:45:52,179 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 60 flow [2021-03-26 10:45:52,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:52,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:52,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:45:52,180 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1183735491, now seen corresponding path program 1 times [2021-03-26 10:45:52,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:52,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222461098] [2021-03-26 10:45:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:52,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:52,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:52,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:52,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:52,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222461098] [2021-03-26 10:45:52,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:52,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:45:52,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707152673] [2021-03-26 10:45:52,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:45:52,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:45:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:45:52,279 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 195 [2021-03-26 10:45:52,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:52,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 195 [2021-03-26 10:45:52,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:52,292 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:45:52,292 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-26 10:45:52,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 18 events. 0/18 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:52,293 INFO L132 encePairwiseOnDemand]: 192/195 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2021-03-26 10:45:52,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:45:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:45:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-26 10:45:52,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2021-03-26 10:45:52,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-26 10:45:52,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-26 10:45:52,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:52,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-26 10:45:52,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,299 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,299 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 60 flow. Second operand 3 states and 535 transitions. [2021-03-26 10:45:52,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 18 transitions, 54 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:45:52,300 INFO L241 Difference]: Finished difference. Result has 30 places, 18 transitions, 56 flow [2021-03-26 10:45:52,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2021-03-26 10:45:52,301 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -18 predicate places. [2021-03-26 10:45:52,301 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:52,301 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 18 transitions, 56 flow [2021-03-26 10:45:52,301 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 18 transitions, 56 flow [2021-03-26 10:45:52,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 18 transitions, 56 flow [2021-03-26 10:45:52,305 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:45:52,305 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:45:52,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 18 events. 0/18 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:52,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-26 10:45:52,329 INFO L154 LiptonReduction]: Checked pairs total: 111 [2021-03-26 10:45:52,329 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:45:52,330 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 10:45:52,337 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 56 flow [2021-03-26 10:45:52,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:52,338 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:52,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:45:52,338 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash -454469125, now seen corresponding path program 1 times [2021-03-26 10:45:52,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:52,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479623709] [2021-03-26 10:45:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:52,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:52,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:45:52,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:52,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:45:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:52,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479623709] [2021-03-26 10:45:52,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:52,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:45:52,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208585823] [2021-03-26 10:45:52,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:45:52,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:45:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:45:52,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-26 10:45:52,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:52,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-26 10:45:52,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:52,508 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:45:52,508 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2021-03-26 10:45:52,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 24 events. 0/24 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 10:45:52,508 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 1 selfloop transitions, 3 changer transitions 1/19 dead transitions. [2021-03-26 10:45:52,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 19 transitions, 71 flow [2021-03-26 10:45:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:45:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:45:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2021-03-26 10:45:52,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8858974358974359 [2021-03-26 10:45:52,512 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2021-03-26 10:45:52,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2021-03-26 10:45:52,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:52,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2021-03-26 10:45:52,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,516 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,516 INFO L185 Difference]: Start difference. First operand has 30 places, 18 transitions, 56 flow. Second operand 4 states and 691 transitions. [2021-03-26 10:45:52,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 19 transitions, 71 flow [2021-03-26 10:45:52,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 19 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:45:52,518 INFO L241 Difference]: Finished difference. Result has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2021-03-26 10:45:52,518 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-26 10:45:52,518 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:52,518 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,519 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 18 transitions, 66 flow [2021-03-26 10:45:52,522 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:45:52,523 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 10:45:52,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 18 events. 0/18 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:52,523 INFO L142 LiptonReduction]: Number of co-enabled transitions 96 [2021-03-26 10:45:52,553 INFO L154 LiptonReduction]: Checked pairs total: 143 [2021-03-26 10:45:52,553 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:45:52,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 10:45:52,558 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 64 flow [2021-03-26 10:45:52,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,559 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:52,559 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:52,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:45:52,559 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1829339697, now seen corresponding path program 1 times [2021-03-26 10:45:52,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:52,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006559455] [2021-03-26 10:45:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:52,737 INFO L142 QuantifierPusher]: treesize reduction 30, result has 47.4 percent of original size [2021-03-26 10:45:52,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 10:45:52,754 INFO L142 QuantifierPusher]: treesize reduction 30, result has 47.4 percent of original size [2021-03-26 10:45:52,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 10:45:52,760 INFO L142 QuantifierPusher]: treesize reduction 30, result has 41.2 percent of original size [2021-03-26 10:45:52,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:45:52,776 INFO L142 QuantifierPusher]: treesize reduction 54, result has 66.7 percent of original size [2021-03-26 10:45:52,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 108 [2021-03-26 10:45:52,835 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.2 percent of original size [2021-03-26 10:45:52,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:45:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:52,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006559455] [2021-03-26 10:45:52,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:52,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:45:52,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766937545] [2021-03-26 10:45:52,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:45:52,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:45:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:45:52,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 196 [2021-03-26 10:45:52,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:52,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 196 [2021-03-26 10:45:52,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:52,986 INFO L129 PetriNetUnfolder]: 6/33 cut-off events. [2021-03-26 10:45:52,986 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-26 10:45:52,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 33 events. 6/33 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2021-03-26 10:45:52,987 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 9 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-03-26 10:45:52,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 21 transitions, 96 flow [2021-03-26 10:45:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:45:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:45:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2021-03-26 10:45:52,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6594387755102041 [2021-03-26 10:45:52,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2021-03-26 10:45:52,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2021-03-26 10:45:52,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:52,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2021-03-26 10:45:52,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,994 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:52,995 INFO L185 Difference]: Start difference. First operand has 32 places, 17 transitions, 64 flow. Second operand 4 states and 517 transitions. [2021-03-26 10:45:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 21 transitions, 96 flow [2021-03-26 10:45:52,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 80 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:45:52,996 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 58 flow [2021-03-26 10:45:52,996 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2021-03-26 10:45:52,996 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -17 predicate places. [2021-03-26 10:45:52,997 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:52,997 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 17 transitions, 58 flow [2021-03-26 10:45:52,997 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 17 transitions, 58 flow [2021-03-26 10:45:52,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 17 transitions, 58 flow [2021-03-26 10:45:53,001 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:45:53,001 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:45:53,001 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:45:53,002 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 10:45:53,036 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 10:45:53,037 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:45:53,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:45:53,038 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 56 flow [2021-03-26 10:45:53,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:53,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:53,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:53,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:45:53,039 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1126489143, now seen corresponding path program 1 times [2021-03-26 10:45:53,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:53,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178885249] [2021-03-26 10:45:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:53,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:53,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:45:53,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:53,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:53,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:53,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:53,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178885249] [2021-03-26 10:45:53,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:53,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:45:53,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639167054] [2021-03-26 10:45:53,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:45:53,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:45:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:45:53,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 197 [2021-03-26 10:45:53,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 16 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:53,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:53,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 197 [2021-03-26 10:45:53,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:53,231 INFO L129 PetriNetUnfolder]: 28/74 cut-off events. [2021-03-26 10:45:53,232 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:45:53,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 74 events. 28/74 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 255 event pairs, 12 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 153. Up to 45 conditions per place. [2021-03-26 10:45:53,233 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 5 selfloop transitions, 4 changer transitions 7/26 dead transitions. [2021-03-26 10:45:53,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 108 flow [2021-03-26 10:45:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:45:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:45:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 858 transitions. [2021-03-26 10:45:53,235 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8710659898477158 [2021-03-26 10:45:53,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 858 transitions. [2021-03-26 10:45:53,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 858 transitions. [2021-03-26 10:45:53,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:53,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 858 transitions. [2021-03-26 10:45:53,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.6) internal successors, (858), 5 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:53,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:53,241 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:53,241 INFO L185 Difference]: Start difference. First operand has 30 places, 16 transitions, 56 flow. Second operand 5 states and 858 transitions. [2021-03-26 10:45:53,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 108 flow [2021-03-26 10:45:53,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 98 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-26 10:45:53,242 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 82 flow [2021-03-26 10:45:53,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2021-03-26 10:45:53,242 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-26 10:45:53,242 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:53,243 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 82 flow [2021-03-26 10:45:53,243 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 82 flow [2021-03-26 10:45:53,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 82 flow [2021-03-26 10:45:53,253 INFO L129 PetriNetUnfolder]: 23/58 cut-off events. [2021-03-26 10:45:53,254 INFO L130 PetriNetUnfolder]: For 28/35 co-relation queries the response was YES. [2021-03-26 10:45:53,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 58 events. 23/58 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 176 event pairs, 11 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 148. Up to 38 conditions per place. [2021-03-26 10:45:53,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-26 10:45:53,704 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-26 10:45:54,176 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-26 10:45:54,915 WARN L205 SmtUtils]: Spent 736.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-26 10:45:55,664 WARN L205 SmtUtils]: Spent 748.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-26 10:45:55,668 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-26 10:45:55,668 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:45:55,668 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2426 [2021-03-26 10:45:55,669 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 83 flow [2021-03-26 10:45:55,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,669 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:55,669 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:55,669 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:45:55,669 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:55,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1179258820, now seen corresponding path program 1 times [2021-03-26 10:45:55,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:55,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375327980] [2021-03-26 10:45:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:55,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:55,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:55,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:55,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:55,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:55,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:55,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:55,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:55,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375327980] [2021-03-26 10:45:55,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:55,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:45:55,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938735705] [2021-03-26 10:45:55,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:45:55,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:55,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:45:55,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:45:55,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 198 [2021-03-26 10:45:55,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:55,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 198 [2021-03-26 10:45:55,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:55,864 INFO L129 PetriNetUnfolder]: 16/55 cut-off events. [2021-03-26 10:45:55,865 INFO L130 PetriNetUnfolder]: For 49/72 co-relation queries the response was YES. [2021-03-26 10:45:55,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 55 events. 16/55 cut-off events. For 49/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 150 event pairs, 2 based on Foata normal form. 11/63 useless extension candidates. Maximal degree in co-relation 174. Up to 35 conditions per place. [2021-03-26 10:45:55,866 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 5 selfloop transitions, 7 changer transitions 7/29 dead transitions. [2021-03-26 10:45:55,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 179 flow [2021-03-26 10:45:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:45:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:45:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1029 transitions. [2021-03-26 10:45:55,869 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661616161616161 [2021-03-26 10:45:55,869 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1029 transitions. [2021-03-26 10:45:55,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1029 transitions. [2021-03-26 10:45:55,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:55,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1029 transitions. [2021-03-26 10:45:55,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,875 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,875 INFO L185 Difference]: Start difference. First operand has 31 places, 19 transitions, 83 flow. Second operand 6 states and 1029 transitions. [2021-03-26 10:45:55,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 179 flow [2021-03-26 10:45:55,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:45:55,879 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 133 flow [2021-03-26 10:45:55,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2021-03-26 10:45:55,880 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-26 10:45:55,880 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:55,880 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 133 flow [2021-03-26 10:45:55,881 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 22 transitions, 133 flow [2021-03-26 10:45:55,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 133 flow [2021-03-26 10:45:55,890 INFO L129 PetriNetUnfolder]: 11/43 cut-off events. [2021-03-26 10:45:55,890 INFO L130 PetriNetUnfolder]: For 67/75 co-relation queries the response was YES. [2021-03-26 10:45:55,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 43 events. 11/43 cut-off events. For 67/75 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 2 based on Foata normal form. 2/43 useless extension candidates. Maximal degree in co-relation 141. Up to 23 conditions per place. [2021-03-26 10:45:55,892 INFO L142 LiptonReduction]: Number of co-enabled transitions 60 [2021-03-26 10:45:55,972 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-26 10:45:55,972 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:45:55,972 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-26 10:45:55,973 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 135 flow [2021-03-26 10:45:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:55,973 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:45:55,973 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:45:55,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:45:55,974 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:45:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:45:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1125103623, now seen corresponding path program 1 times [2021-03-26 10:45:55,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:45:55,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525372430] [2021-03-26 10:45:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:45:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:45:56,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:56,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:56,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:56,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:56,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:56,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:56,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:56,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:45:56,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:45:56,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:45:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:45:56,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525372430] [2021-03-26 10:45:56,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:45:56,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:45:56,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115400867] [2021-03-26 10:45:56,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:45:56,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:45:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:45:56,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:45:56,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2021-03-26 10:45:56,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:56,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:45:56,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2021-03-26 10:45:56,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:45:56,179 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-26 10:45:56,179 INFO L130 PetriNetUnfolder]: For 99/132 co-relation queries the response was YES. [2021-03-26 10:45:56,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 36 events. 7/36 cut-off events. For 99/132 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 10/43 useless extension candidates. Maximal degree in co-relation 132. Up to 20 conditions per place. [2021-03-26 10:45:56,180 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 2 selfloop transitions, 10 changer transitions 4/26 dead transitions. [2021-03-26 10:45:56,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 203 flow [2021-03-26 10:45:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:45:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:45:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1194 transitions. [2021-03-26 10:45:56,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-26 10:45:56,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1194 transitions. [2021-03-26 10:45:56,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1194 transitions. [2021-03-26 10:45:56,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:45:56,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1194 transitions. [2021-03-26 10:45:56,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:56,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:56,193 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:45:56,193 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 135 flow. Second operand 7 states and 1194 transitions. [2021-03-26 10:45:56,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 203 flow [2021-03-26 10:45:56,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 163 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-26 10:45:56,197 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 133 flow [2021-03-26 10:45:56,197 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-03-26 10:45:56,197 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 10:45:56,197 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:45:56,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 133 flow [2021-03-26 10:45:56,198 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 133 flow [2021-03-26 10:45:56,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 133 flow [2021-03-26 10:45:56,203 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-26 10:45:56,203 INFO L130 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2021-03-26 10:45:56,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 30 events. 5/30 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 80. Up to 11 conditions per place. [2021-03-26 10:45:56,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 40 [2021-03-26 10:45:56,453 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-26 10:45:57,021 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 105 [2021-03-26 10:45:57,176 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2021-03-26 10:45:57,343 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-26 10:45:57,528 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-26 10:45:57,804 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:45:58,069 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:45:58,274 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-26 10:45:58,454 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-26 10:45:58,778 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 10:45:59,093 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 10:45:59,195 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:45:59,297 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:45:59,473 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:45:59,647 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:45:59,751 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:45:59,854 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:46:00,024 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:46:00,201 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 10:46:00,203 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-26 10:46:00,203 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:46:00,204 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4007 [2021-03-26 10:46:00,204 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 129 flow [2021-03-26 10:46:00,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:46:00,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:46:00,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:46:00,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:46:00,205 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:46:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:46:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1467794390, now seen corresponding path program 1 times [2021-03-26 10:46:00,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:46:00,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205873299] [2021-03-26 10:46:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:46:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:46:00,272 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:46:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:46:00,331 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:46:00,381 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:46:00,381 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:46:00,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:46:00,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:46:00 BasicIcfg [2021-03-26 10:46:00,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:46:00,519 INFO L168 Benchmark]: Toolchain (without parser) took 31448.21 ms. Allocated memory was 373.3 MB in the beginning and 650.1 MB in the end (delta: 276.8 MB). Free memory was 336.5 MB in the beginning and 346.8 MB in the end (delta: -10.3 MB). Peak memory consumption was 269.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,519 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 373.3 MB. Free memory was 355.0 MB in the beginning and 354.9 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:46:00,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.18 ms. Allocated memory is still 373.3 MB. Free memory was 336.3 MB in the beginning and 333.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 373.3 MB. Free memory was 332.2 MB in the beginning and 330.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,520 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 373.3 MB. Free memory was 330.1 MB in the beginning and 328.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,520 INFO L168 Benchmark]: RCFGBuilder took 1889.56 ms. Allocated memory is still 373.3 MB. Free memory was 328.0 MB in the beginning and 261.3 MB in the end (delta: 66.7 MB). Peak memory consumption was 118.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,520 INFO L168 Benchmark]: TraceAbstraction took 28962.81 ms. Allocated memory was 373.3 MB in the beginning and 650.1 MB in the end (delta: 276.8 MB). Free memory was 260.2 MB in the beginning and 346.8 MB in the end (delta: -86.6 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:46:00,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71 ms. Allocated memory is still 373.3 MB. Free memory was 355.0 MB in the beginning and 354.9 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 501.18 ms. Allocated memory is still 373.3 MB. Free memory was 336.3 MB in the beginning and 333.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 373.3 MB. Free memory was 332.2 MB in the beginning and 330.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 373.3 MB. Free memory was 330.1 MB in the beginning and 328.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1889.56 ms. Allocated memory is still 373.3 MB. Free memory was 328.0 MB in the beginning and 261.3 MB in the end (delta: 66.7 MB). Peak memory consumption was 118.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 28962.81 ms. Allocated memory was 373.3 MB in the beginning and 650.1 MB in the end (delta: 276.8 MB). Free memory was 260.2 MB in the beginning and 346.8 MB in the end (delta: -86.6 MB). Peak memory consumption was 190.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8793.0ms, 108 PlacesBefore, 48 PlacesAfterwards, 99 TransitionsBefore, 39 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 4 FixpointIterations, 38 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, 1446 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 801, positive: 746, positive conditional: 746, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 801, positive: 746, positive conditional: 0, positive unconditional: 746, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 801, positive: 746, positive conditional: 0, positive unconditional: 746, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 636, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 636, positive: 600, positive conditional: 0, positive unconditional: 600, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1999, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 535, negative conditional: 0, negative unconditional: 535, unknown: 1442, unknown conditional: 0, unknown unconditional: 1442] ], Cache Queries: [ total: 801, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 636, unknown conditional: 0, unknown unconditional: 636] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 607, Positive conditional cache size: 0, Positive unconditional cache size: 607, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1929.9ms, 47 PlacesBefore, 32 PlacesAfterwards, 37 TransitionsBefore, 22 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 893 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, positive: 265, positive conditional: 265, positive unconditional: 0, negative: 79, negative conditional: 79, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, positive: 265, positive conditional: 0, positive unconditional: 265, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, positive: 265, positive conditional: 0, positive unconditional: 265, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 651, Positive conditional cache size: 0, Positive unconditional cache size: 651, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9027.7ms, 35 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 372 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3937, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3937, unknown conditional: 0, unknown unconditional: 3937] ], Cache Queries: [ total: 154, positive: 108, positive conditional: 0, positive unconditional: 108, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 702, Positive cache size: 658, Positive conditional cache size: 0, Positive unconditional cache size: 658, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.3ms, 30 PlacesBefore, 30 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 705, Positive cache size: 660, Positive conditional cache size: 0, Positive unconditional cache size: 660, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.6ms, 33 PlacesBefore, 32 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 143 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 663, Positive conditional cache size: 0, Positive unconditional cache size: 663, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.9ms, 31 PlacesBefore, 30 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 711, Positive cache size: 666, Positive conditional cache size: 0, Positive unconditional cache size: 666, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2425.1ms, 33 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 4, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 671, Positive conditional cache size: 4, Positive unconditional cache size: 667, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.6ms, 37 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 719, Positive cache size: 674, Positive conditional cache size: 7, Positive unconditional cache size: 667, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4005.7ms, 39 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 677, Positive conditional cache size: 10, Positive unconditional cache size: 667, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2696; [L837] FCALL, FORK 0 pthread_create(&t2696, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L768] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0) [L768] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L771] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L772] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1) [L772] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 [L781] 1 x = 1 [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L838] 0 pthread_t t2697; [L839] FCALL, FORK 0 pthread_create(&t2697, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_p1_EAX = x [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t2698; [L841] FCALL, FORK 0 pthread_create(&t2698, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = y [L811] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={7:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 28668.5ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 590.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8878.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25 SDtfs, 11 SDslu, 13 SDs, 0 SdLazy, 142 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 181.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 212.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.6ms SsaConstructionTime, 596.0ms SatisfiabilityAnalysisTime, 651.8ms InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...