/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/mix022_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:39:08,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:39:08,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:39:08,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:39:08,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:39:08,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:39:08,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:39:08,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:39:08,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:39:08,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:39:08,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:39:08,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:39:08,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:39:08,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:39:08,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:39:08,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:39:08,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:39:08,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:39:08,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:39:08,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:39:08,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:39:08,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:39:08,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:39:08,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:39:08,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:39:08,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:39:08,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:39:08,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:39:08,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:39:08,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:39:08,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:39:08,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:39:08,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:39:08,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:39:08,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:39:08,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:39:08,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:39:08,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:39:08,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:39:08,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:39:08,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:39:08,691 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-06-11 15:39:08,717 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:39:08,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:39:08,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:39:08,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:39:08,720 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:39:08,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:39:08,720 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:39:08,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:39:08,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:39:08,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:39:08,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:39:08,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:39:08,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:39:08,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:39:08,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:39:08,723 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-06-11 15:39:08,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:39:08,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:39:08,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:39:08,976 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:39:08,977 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:39:08,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2021-06-11 15:39:09,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6d4b986/df4996f40eff42e2b2e6f5c602fb04c2/FLAG1560cae99 [2021-06-11 15:39:09,409 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:39:09,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2021-06-11 15:39:09,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6d4b986/df4996f40eff42e2b2e6f5c602fb04c2/FLAG1560cae99 [2021-06-11 15:39:09,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6d4b986/df4996f40eff42e2b2e6f5c602fb04c2 [2021-06-11 15:39:09,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:39:09,801 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:39:09,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:39:09,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:39:09,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:39:09,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:39:09" (1/1) ... [2021-06-11 15:39:09,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11540ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:09, skipping insertion in model container [2021-06-11 15:39:09,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:39:09" (1/1) ... [2021-06-11 15:39:09,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:39:09,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:39:09,977 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/mix022_tso.opt.i[948,961] [2021-06-11 15:39:10,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:39:10,108 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:39:10,118 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/mix022_tso.opt.i[948,961] [2021-06-11 15:39:10,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:39:10,220 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:39:10,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10 WrapperNode [2021-06-11 15:39:10,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:39:10,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:39:10,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:39:10,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:39:10,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:39:10,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:39:10,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:39:10,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:39:10,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (1/1) ... [2021-06-11 15:39:10,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:39:10,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:39:10,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:39:10,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:39:10,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (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-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:39:10,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:39:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:39:10,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:39:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:39:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:39:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:39:10,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:39:10,406 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:39:12,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:39:12,151 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:39:12,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:39:12 BoogieIcfgContainer [2021-06-11 15:39:12,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:39:12,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:39:12,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:39:12,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:39:12,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:39:09" (1/3) ... [2021-06-11 15:39:12,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7244ab34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:39:12, skipping insertion in model container [2021-06-11 15:39:12,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:39:10" (2/3) ... [2021-06-11 15:39:12,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7244ab34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:39:12, skipping insertion in model container [2021-06-11 15:39:12,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:39:12" (3/3) ... [2021-06-11 15:39:12,159 INFO L111 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2021-06-11 15:39:12,164 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:39:12,167 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:39:12,168 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:39:12,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,197 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,197 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,202 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,203 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,226 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,228 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:39:12,233 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:39:12,246 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 15:39:12,270 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:39:12,270 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:39:12,270 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:39:12,270 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:39:12,270 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:39:12,270 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:39:12,270 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:39:12,270 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:39:12,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 174 flow [2021-06-11 15:39:12,303 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-06-11 15:39:12,304 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:12,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-11 15:39:12,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 82 transitions, 174 flow [2021-06-11 15:39:12,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 166 flow [2021-06-11 15:39:12,310 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:12,319 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 166 flow [2021-06-11 15:39:12,322 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 166 flow [2021-06-11 15:39:12,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 166 flow [2021-06-11 15:39:12,335 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-06-11 15:39:12,335 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:12,335 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-11 15:39:12,337 INFO L151 LiptonReduction]: Number of co-enabled transitions 982 [2021-06-11 15:39:12,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:12,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:12,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:12,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:12,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:12,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,046 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:13,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:13,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:13,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,160 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:39:13,161 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:13,180 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,392 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:39:13,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:13,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:13,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:13,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:13,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:13,983 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:39:14,340 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:39:14,456 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:39:14,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:14,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:39:14,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:14,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,479 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:39:14,479 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:14,481 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,482 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:39:14,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:14,485 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:39:14,485 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:39:14,486 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:14,489 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,492 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:39:14,492 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:39:14,493 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:14,494 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,499 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:39:14,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:14,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:14,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:14,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:14,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:14,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:14,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:39:14,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 15:39:15,423 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2021-06-11 15:39:15,693 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-11 15:39:16,963 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-06-11 15:39:17,563 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 15:39:17,566 INFO L142 QuantifierPusher]: treesize reduction 14, result has 30.0 percent of original size [2021-06-11 15:39:17,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:18,256 WARN L205 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-06-11 15:39:18,556 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-06-11 15:39:19,855 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-06-11 15:39:20,437 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 15:39:20,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:20,529 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:39:20,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:20,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:20,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:20,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:20,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:20,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:20,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:20,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:21,155 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-06-11 15:39:21,477 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-06-11 15:39:22,698 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2021-06-11 15:39:23,318 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 15:39:23,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:23,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:23,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:23,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:23,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:23,914 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 15:39:24,204 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-06-11 15:39:24,812 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-06-11 15:39:25,466 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-06-11 15:39:25,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:25,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:25,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:25,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:25,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:25,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:25,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:25,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:25,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:26,790 WARN L205 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 200 [2021-06-11 15:39:27,154 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 15:39:27,866 WARN L205 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-11 15:39:28,478 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 278 [2021-06-11 15:39:28,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:28,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:28,788 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-11 15:39:28,911 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 15:39:29,166 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-06-11 15:39:29,310 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-06-11 15:39:29,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:29,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:29,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:29,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:29,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:39:29,411 INFO L163 LiptonReduction]: Checked pairs total: 2808 [2021-06-11 15:39:29,411 INFO L165 LiptonReduction]: Total number of compositions: 79 [2021-06-11 15:39:29,413 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17104 [2021-06-11 15:39:29,418 INFO L129 PetriNetUnfolder]: 1/8 cut-off events. [2021-06-11 15:39:29,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:29,419 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:29,419 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 15:39:29,419 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1199048693, now seen corresponding path program 1 times [2021-06-11 15:39:29,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:29,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155770115] [2021-06-11 15:39:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:29,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:29,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:29,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155770115] [2021-06-11 15:39:29,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:29,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:39:29,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126791180] [2021-06-11 15:39:29,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:39:29,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:29,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:39:29,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:39:29,614 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 161 [2021-06-11 15:39:29,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-06-11 15:39:29,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:29,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 161 [2021-06-11 15:39:29,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:29,685 INFO L129 PetriNetUnfolder]: 33/78 cut-off events. [2021-06-11 15:39:29,685 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:29,686 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 78 events. 33/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 283 event pairs, 15 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 142. Up to 55 conditions per place. [2021-06-11 15:39:29,687 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 8 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2021-06-11 15:39:29,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 74 flow [2021-06-11 15:39:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:39:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:39:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2021-06-11 15:39:29,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2021-06-11 15:39:29,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2021-06-11 15:39:29,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2021-06-11 15:39:29,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:29,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2021-06-11 15:39:29,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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-06-11 15:39:29,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-06-11 15:39:29,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-06-11 15:39:29,710 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 50 flow. Second operand 3 states and 385 transitions. [2021-06-11 15:39:29,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 74 flow [2021-06-11 15:39:29,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:39:29,713 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2021-06-11 15:39:29,714 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-06-11 15:39:29,714 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2021-06-11 15:39:29,714 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:29,714 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 42 flow [2021-06-11 15:39:29,715 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 42 flow [2021-06-11 15:39:29,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 17 transitions, 42 flow [2021-06-11 15:39:29,717 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-06-11 15:39:29,717 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:29,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:39:29,718 INFO L151 LiptonReduction]: Number of co-enabled transitions 128 [2021-06-11 15:39:29,811 INFO L163 LiptonReduction]: Checked pairs total: 150 [2021-06-11 15:39:29,811 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:39:29,811 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-06-11 15:39:29,812 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-06-11 15:39:29,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-06-11 15:39:29,812 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:29,812 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:29,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:39:29,813 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1234641362, now seen corresponding path program 1 times [2021-06-11 15:39:29,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:29,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309028848] [2021-06-11 15:39:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:29,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:29,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:29,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309028848] [2021-06-11 15:39:29,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:29,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:39:29,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605171650] [2021-06-11 15:39:29,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:39:29,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:29,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:39:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:39:29,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 161 [2021-06-11 15:39:29,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-06-11 15:39:29,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:29,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 161 [2021-06-11 15:39:29,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:29,882 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-06-11 15:39:29,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:29,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 1/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:39:29,883 INFO L132 encePairwiseOnDemand]: 158/161 looper letters, 1 selfloop transitions, 2 changer transitions 1/17 dead transitions. [2021-06-11 15:39:29,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-06-11 15:39:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:39:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:39:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2021-06-11 15:39:29,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8219461697722568 [2021-06-11 15:39:29,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2021-06-11 15:39:29,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2021-06-11 15:39:29,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:29,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2021-06-11 15:39:29,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-06-11 15:39:29,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-06-11 15:39:29,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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-06-11 15:39:29,888 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 397 transitions. [2021-06-11 15:39:29,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-06-11 15:39:29,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:39:29,888 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 44 flow [2021-06-11 15:39:29,888 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-06-11 15:39:29,889 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2021-06-11 15:39:29,889 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:29,889 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 44 flow [2021-06-11 15:39:29,889 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 44 flow [2021-06-11 15:39:29,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-06-11 15:39:29,892 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-06-11 15:39:29,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:39:29,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:39:29,892 INFO L151 LiptonReduction]: Number of co-enabled transitions 106 [2021-06-11 15:39:29,927 INFO L163 LiptonReduction]: Checked pairs total: 127 [2021-06-11 15:39:29,928 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:39:29,928 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-06-11 15:39:29,929 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2021-06-11 15:39:29,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-06-11 15:39:29,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:29,930 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:29,930 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:39:29,930 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:29,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1036046650, now seen corresponding path program 1 times [2021-06-11 15:39:29,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:29,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706939626] [2021-06-11 15:39:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:30,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:39:30,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:39:30,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:39:30,088 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-06-11 15:39:30,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:39:30,108 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-06-11 15:39:30,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:39:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:30,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706939626] [2021-06-11 15:39:30,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:30,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:39:30,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504410777] [2021-06-11 15:39:30,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:39:30,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:30,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:39:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:39:30,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 161 [2021-06-11 15:39:30,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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-06-11 15:39:30,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:30,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 161 [2021-06-11 15:39:30,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:30,309 INFO L129 PetriNetUnfolder]: 100/194 cut-off events. [2021-06-11 15:39:30,309 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2021-06-11 15:39:30,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 194 events. 100/194 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 702 event pairs, 20 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 407. Up to 143 conditions per place. [2021-06-11 15:39:30,311 INFO L132 encePairwiseOnDemand]: 153/161 looper letters, 20 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2021-06-11 15:39:30,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 170 flow [2021-06-11 15:39:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:39:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:39:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 716 transitions. [2021-06-11 15:39:30,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6353149955634427 [2021-06-11 15:39:30,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 716 transitions. [2021-06-11 15:39:30,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 716 transitions. [2021-06-11 15:39:30,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:30,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 716 transitions. [2021-06-11 15:39:30,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.28571428571429) internal successors, (716), 7 states have internal predecessors, (716), 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-06-11 15:39:30,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 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-06-11 15:39:30,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 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-06-11 15:39:30,318 INFO L185 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 7 states and 716 transitions. [2021-06-11 15:39:30,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 170 flow [2021-06-11 15:39:30,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:39:30,319 INFO L241 Difference]: Finished difference. Result has 32 places, 30 transitions, 135 flow [2021-06-11 15:39:30,319 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2021-06-11 15:39:30,319 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2021-06-11 15:39:30,319 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:30,319 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 30 transitions, 135 flow [2021-06-11 15:39:30,320 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 30 transitions, 135 flow [2021-06-11 15:39:30,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 135 flow [2021-06-11 15:39:30,328 INFO L129 PetriNetUnfolder]: 15/60 cut-off events. [2021-06-11 15:39:30,329 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-11 15:39:30,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 60 events. 15/60 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 226 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 135. Up to 22 conditions per place. [2021-06-11 15:39:30,329 INFO L151 LiptonReduction]: Number of co-enabled transitions 144 [2021-06-11 15:39:30,334 INFO L163 LiptonReduction]: Checked pairs total: 148 [2021-06-11 15:39:30,334 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:39:30,334 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 15:39:30,335 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 135 flow [2021-06-11 15:39:30,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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-06-11 15:39:30,336 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:30,336 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:30,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:39:30,336 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1038553930, now seen corresponding path program 2 times [2021-06-11 15:39:30,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:30,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663185980] [2021-06-11 15:39:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:30,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:30,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:39:30,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:30,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:30,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663185980] [2021-06-11 15:39:30,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:30,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:39:30,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628839287] [2021-06-11 15:39:30,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:39:30,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:39:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:39:30,426 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2021-06-11 15:39:30,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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-06-11 15:39:30,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:30,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2021-06-11 15:39:30,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:30,468 INFO L129 PetriNetUnfolder]: 15/64 cut-off events. [2021-06-11 15:39:30,468 INFO L130 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2021-06-11 15:39:30,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 64 events. 15/64 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 4 based on Foata normal form. 9/70 useless extension candidates. Maximal degree in co-relation 157. Up to 21 conditions per place. [2021-06-11 15:39:30,468 INFO L132 encePairwiseOnDemand]: 156/161 looper letters, 4 selfloop transitions, 6 changer transitions 3/34 dead transitions. [2021-06-11 15:39:30,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 160 flow [2021-06-11 15:39:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:39:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:39:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2021-06-11 15:39:30,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.768944099378882 [2021-06-11 15:39:30,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2021-06-11 15:39:30,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2021-06-11 15:39:30,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:30,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2021-06-11 15:39:30,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 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-06-11 15:39:30,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 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-06-11 15:39:30,473 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 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-06-11 15:39:30,473 INFO L185 Difference]: Start difference. First operand has 32 places, 30 transitions, 135 flow. Second operand 5 states and 619 transitions. [2021-06-11 15:39:30,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 160 flow [2021-06-11 15:39:30,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 149 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:39:30,475 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 150 flow [2021-06-11 15:39:30,475 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-11 15:39:30,475 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2021-06-11 15:39:30,475 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:30,475 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 150 flow [2021-06-11 15:39:30,476 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 150 flow [2021-06-11 15:39:30,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 150 flow [2021-06-11 15:39:30,482 INFO L129 PetriNetUnfolder]: 14/65 cut-off events. [2021-06-11 15:39:30,483 INFO L130 PetriNetUnfolder]: For 47/49 co-relation queries the response was YES. [2021-06-11 15:39:30,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 65 events. 14/65 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 220 event pairs, 2 based on Foata normal form. 2/65 useless extension candidates. Maximal degree in co-relation 169. Up to 19 conditions per place. [2021-06-11 15:39:30,483 INFO L151 LiptonReduction]: Number of co-enabled transitions 132 [2021-06-11 15:39:30,670 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-06-11 15:39:31,065 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-06-11 15:39:31,203 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-06-11 15:39:31,235 INFO L142 QuantifierPusher]: treesize reduction 84, result has 93.5 percent of original size [2021-06-11 15:39:31,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,246 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:39:31,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:31,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:31,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:31,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,264 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:39:31,264 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:39:31,264 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,265 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,266 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:39:31,266 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,267 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,267 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:39:31,267 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,270 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,273 INFO L147 QuantifierPusher]: treesize reduction 178, result has 42.4 percent of original size 131 [2021-06-11 15:39:31,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,275 INFO L142 QuantifierPusher]: treesize reduction 178, result has 57.0 percent of original size [2021-06-11 15:39:31,275 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 15:39:31,276 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,277 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,277 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:39:31,277 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,282 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,283 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 4, 2, 2, 1] term [2021-06-11 15:39:31,283 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,284 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,286 INFO L147 QuantifierPusher]: treesize reduction 406, result has 27.9 percent of original size 157 [2021-06-11 15:39:31,287 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:31,287 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,288 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,288 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:31,288 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,291 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,291 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 3, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:31,291 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,292 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:31,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,302 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:39:31,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:39:31,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,327 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:39:31,327 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,328 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,330 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:39:31,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:31,331 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:39:31,332 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:39:31,332 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,333 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,334 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 15:39:31,334 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:39:31,334 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:31,338 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,348 INFO L147 QuantifierPusher]: treesize reduction 1754, result has 19.5 percent of original size 426 [2021-06-11 15:39:31,370 INFO L163 LiptonReduction]: Checked pairs total: 246 [2021-06-11 15:39:31,370 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:39:31,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 895 [2021-06-11 15:39:31,371 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 150 flow [2021-06-11 15:39:31,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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-06-11 15:39:31,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:31,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:31,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:39:31,372 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:31,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1228072655, now seen corresponding path program 1 times [2021-06-11 15:39:31,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:31,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439797055] [2021-06-11 15:39:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:31,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:31,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:31,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:39:31,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:31,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439797055] [2021-06-11 15:39:31,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:31,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:39:31,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368211751] [2021-06-11 15:39:31,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:39:31,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:39:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:39:31,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 162 [2021-06-11 15:39:31,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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-06-11 15:39:31,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:31,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 162 [2021-06-11 15:39:31,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:31,557 INFO L129 PetriNetUnfolder]: 11/52 cut-off events. [2021-06-11 15:39:31,557 INFO L130 PetriNetUnfolder]: For 78/88 co-relation queries the response was YES. [2021-06-11 15:39:31,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 52 events. 11/52 cut-off events. For 78/88 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 154 event pairs, 2 based on Foata normal form. 15/65 useless extension candidates. Maximal degree in co-relation 152. Up to 17 conditions per place. [2021-06-11 15:39:31,560 INFO L132 encePairwiseOnDemand]: 157/162 looper letters, 2 selfloop transitions, 9 changer transitions 2/34 dead transitions. [2021-06-11 15:39:31,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 192 flow [2021-06-11 15:39:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:39:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:39:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2021-06-11 15:39:31,562 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2021-06-11 15:39:31,562 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2021-06-11 15:39:31,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2021-06-11 15:39:31,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:31,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2021-06-11 15:39:31,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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-06-11 15:39:31,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 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-06-11 15:39:31,567 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 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-06-11 15:39:31,567 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 150 flow. Second operand 7 states and 868 transitions. [2021-06-11 15:39:31,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 192 flow [2021-06-11 15:39:31,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 181 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:39:31,570 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 176 flow [2021-06-11 15:39:31,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-06-11 15:39:31,570 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 17 predicate places. [2021-06-11 15:39:31,570 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:31,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 176 flow [2021-06-11 15:39:31,570 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 176 flow [2021-06-11 15:39:31,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 176 flow [2021-06-11 15:39:31,578 INFO L129 PetriNetUnfolder]: 13/55 cut-off events. [2021-06-11 15:39:31,579 INFO L130 PetriNetUnfolder]: For 85/86 co-relation queries the response was YES. [2021-06-11 15:39:31,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 55 events. 13/55 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 155. Up to 19 conditions per place. [2021-06-11 15:39:31,579 INFO L151 LiptonReduction]: Number of co-enabled transitions 100 [2021-06-11 15:39:31,585 INFO L163 LiptonReduction]: Checked pairs total: 114 [2021-06-11 15:39:31,586 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:39:31,586 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 15:39:31,587 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 176 flow [2021-06-11 15:39:31,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 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-06-11 15:39:31,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:31,587 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:31,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:39:31,587 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:31,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1672499591, now seen corresponding path program 1 times [2021-06-11 15:39:31,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:31,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424935802] [2021-06-11 15:39:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:39:31,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:31,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:31,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:31,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:39:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:39:31,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424935802] [2021-06-11 15:39:31,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:39:31,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:39:31,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873470204] [2021-06-11 15:39:31,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:39:31,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:39:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:39:31,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:39:31,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2021-06-11 15:39:31,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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-06-11 15:39:31,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:39:31,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2021-06-11 15:39:31,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:39:31,678 INFO L129 PetriNetUnfolder]: 17/80 cut-off events. [2021-06-11 15:39:31,679 INFO L130 PetriNetUnfolder]: For 131/132 co-relation queries the response was YES. [2021-06-11 15:39:31,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 80 events. 17/80 cut-off events. For 131/132 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 323 event pairs, 4 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 252. Up to 27 conditions per place. [2021-06-11 15:39:31,680 INFO L132 encePairwiseOnDemand]: 159/162 looper letters, 3 selfloop transitions, 1 changer transitions 5/33 dead transitions. [2021-06-11 15:39:31,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 188 flow [2021-06-11 15:39:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:39:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:39:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2021-06-11 15:39:31,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7808641975308642 [2021-06-11 15:39:31,681 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2021-06-11 15:39:31,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2021-06-11 15:39:31,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:39:31,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2021-06-11 15:39:31,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 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-06-11 15:39:31,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 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-06-11 15:39:31,684 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 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-06-11 15:39:31,684 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 176 flow. Second operand 4 states and 506 transitions. [2021-06-11 15:39:31,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 188 flow [2021-06-11 15:39:31,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 159 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-11 15:39:31,688 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 138 flow [2021-06-11 15:39:31,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2021-06-11 15:39:31,688 INFO L343 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2021-06-11 15:39:31,688 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:39:31,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 138 flow [2021-06-11 15:39:31,688 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 138 flow [2021-06-11 15:39:31,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 138 flow [2021-06-11 15:39:31,694 INFO L129 PetriNetUnfolder]: 11/55 cut-off events. [2021-06-11 15:39:31,694 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-06-11 15:39:31,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 55 events. 11/55 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 165 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 143. Up to 16 conditions per place. [2021-06-11 15:39:31,694 INFO L151 LiptonReduction]: Number of co-enabled transitions 52 [2021-06-11 15:39:32,166 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 159 [2021-06-11 15:39:32,283 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-06-11 15:39:33,703 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 328 DAG size of output: 226 [2021-06-11 15:39:34,010 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 15:39:34,038 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 15:39:34,044 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:34,052 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:34,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,059 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:39:34,059 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:39:34,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,064 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:39:34,064 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:39:34,065 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,065 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,066 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:39:34,066 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,069 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,069 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:39:34,069 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,070 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,072 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 15:39:34,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,073 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 15:39:34,074 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 15:39:34,074 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,074 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,075 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:39:34,075 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,076 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,077 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 3, 2, 1] term [2021-06-11 15:39:34,077 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,077 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,081 INFO L147 QuantifierPusher]: treesize reduction 445, result has 26.9 percent of original size 164 [2021-06-11 15:39:34,081 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:34,082 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,083 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,084 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:34,084 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,086 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,086 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:39:34,086 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:39:34,087 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:39:34,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:34,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:39:34,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,095 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:39:34,100 INFO L147 QuantifierPusher]: treesize reduction 1749, result has 14.8 percent of original size 304 [2021-06-11 15:39:34,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:39:34,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:39:34,165 INFO L163 LiptonReduction]: Checked pairs total: 35 [2021-06-11 15:39:34,165 INFO L165 LiptonReduction]: Total number of compositions: 4 [2021-06-11 15:39:34,166 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2478 [2021-06-11 15:39:34,166 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 140 flow [2021-06-11 15:39:34,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 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-06-11 15:39:34,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:39:34,166 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:39:34,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:39:34,166 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:39:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:39:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash 577651117, now seen corresponding path program 1 times [2021-06-11 15:39:34,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:39:34,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896106005] [2021-06-11 15:39:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:39:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:39:34,209 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:39:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:39:34,279 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:39:34,311 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:39:34,311 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:39:34,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 15:39:34,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:39:34 BasicIcfg [2021-06-11 15:39:34,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:39:34,371 INFO L168 Benchmark]: Toolchain (without parser) took 24569.62 ms. Allocated memory was 346.0 MB in the beginning and 828.4 MB in the end (delta: 482.3 MB). Free memory was 307.7 MB in the beginning and 570.2 MB in the end (delta: -262.5 MB). Peak memory consumption was 221.9 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,371 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 346.0 MB. Free memory is still 326.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:39:34,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.40 ms. Allocated memory is still 346.0 MB. Free memory was 307.4 MB in the beginning and 303.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 346.0 MB. Free memory was 303.3 MB in the beginning and 299.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,371 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 ms. Allocated memory is still 346.0 MB. Free memory was 299.1 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,371 INFO L168 Benchmark]: RCFGBuilder took 1853.65 ms. Allocated memory is still 346.0 MB. Free memory was 297.0 MB in the beginning and 168.3 MB in the end (delta: 128.7 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,372 INFO L168 Benchmark]: TraceAbstraction took 22215.27 ms. Allocated memory was 346.0 MB in the beginning and 828.4 MB in the end (delta: 482.3 MB). Free memory was 168.3 MB in the beginning and 570.2 MB in the end (delta: -401.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.0 GB. [2021-06-11 15:39:34,372 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.12 ms. Allocated memory is still 346.0 MB. Free memory is still 326.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 417.40 ms. Allocated memory is still 346.0 MB. Free memory was 307.4 MB in the beginning and 303.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 56.09 ms. Allocated memory is still 346.0 MB. Free memory was 303.3 MB in the beginning and 299.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.69 ms. Allocated memory is still 346.0 MB. Free memory was 299.1 MB in the beginning and 297.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1853.65 ms. Allocated memory is still 346.0 MB. Free memory was 297.0 MB in the beginning and 168.3 MB in the end (delta: 128.7 MB). Peak memory consumption was 146.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22215.27 ms. Allocated memory was 346.0 MB in the beginning and 828.4 MB in the end (delta: 482.3 MB). Free memory was 168.3 MB in the beginning and 570.2 MB in the end (delta: -401.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17089.5ms, 85 PlacesBefore, 27 PlacesAfterwards, 80 TransitionsBefore, 22 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 79 TotalNumberOfCompositions, 2808 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1184, positive: 1067, positive conditional: 1067, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1184, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1184, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 760, positive: 705, positive conditional: 0, positive unconditional: 705, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 760, positive: 685, positive conditional: 0, positive unconditional: 685, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 972, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 944, negative conditional: 0, negative unconditional: 944, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1184, positive: 362, positive conditional: 0, positive unconditional: 362, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 760, unknown conditional: 0, unknown unconditional: 760] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 705, Positive conditional cache size: 0, Positive unconditional cache size: 705, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.7ms, 25 PlacesBefore, 24 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 33, 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: 49, positive: 33, positive conditional: 5, positive unconditional: 28, negative: 16, negative conditional: 5, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 33, positive conditional: 5, positive unconditional: 28, negative: 16, negative conditional: 5, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 91, negative conditional: 91, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 29, positive conditional: 1, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 769, Positive cache size: 709, Positive conditional cache size: 4, Positive unconditional cache size: 705, Negative cache size: 60, Negative conditional cache size: 5, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.3ms, 25 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 7, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 713, Positive conditional cache size: 4, Positive unconditional cache size: 709, Negative cache size: 63, Negative conditional cache size: 5, Negative unconditional cache size: 58, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.8ms, 32 PlacesBefore, 32 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 61, positive conditional: 33, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 61, positive conditional: 33, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 74, positive: 57, positive conditional: 30, positive unconditional: 27, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 717, Positive conditional cache size: 7, Positive unconditional cache size: 710, Negative cache size: 63, Negative conditional cache size: 5, Negative unconditional cache size: 58, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 894.6ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, positive: 145, positive conditional: 73, positive unconditional: 72, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 145, positive conditional: 73, positive unconditional: 72, negative: 22, negative conditional: 6, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, positive: 144, positive conditional: 72, positive unconditional: 72, negative: 20, negative conditional: 4, negative unconditional: 16, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 783, Positive cache size: 718, Positive conditional cache size: 8, Positive unconditional cache size: 710, Negative cache size: 65, Negative conditional cache size: 7, Negative unconditional cache size: 58, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2ms, 44 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 114 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, positive: 51, positive conditional: 51, 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: 63, positive: 51, positive conditional: 34, positive unconditional: 17, negative: 12, negative conditional: 3, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 51, positive conditional: 34, positive unconditional: 17, negative: 12, negative conditional: 3, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 51, positive conditional: 34, positive unconditional: 17, negative: 11, negative conditional: 3, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 718, Positive conditional cache size: 8, Positive unconditional cache size: 710, Negative cache size: 66, Negative conditional cache size: 7, Negative unconditional cache size: 59, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2477.0ms, 42 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 35 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 35, 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: 35, positive: 35, positive conditional: 25, positive unconditional: 10, 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: 35, positive: 35, positive conditional: 25, positive unconditional: 10, 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: 4, positive: 4, positive conditional: 2, positive unconditional: 2, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 35, positive: 31, positive conditional: 23, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 722, Positive conditional cache size: 10, Positive unconditional cache size: 712, Negative cache size: 66, Negative conditional cache size: 7, Negative unconditional cache size: 59, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t599; [L811] FCALL, FORK 0 pthread_create(&t599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t600; [L813] FCALL, FORK 0 pthread_create(&t600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22044.3ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 465.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17146.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 19 SDtfs, 14 SDslu, 8 SDs, 0 SdLazy, 105 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 148.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 118.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 29, 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: 24.2ms SsaConstructionTime, 323.1ms SatisfiabilityAnalysisTime, 324.3ms InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...