/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:27:28,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:27:28,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:27:28,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:27:28,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:27:28,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:27:28,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:27:28,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:27:28,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:27:28,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:27:28,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:27:28,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:27:28,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:27:28,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:27:28,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:27:28,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:27:28,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:27:28,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:27:28,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:27:28,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:27:28,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:27:28,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:27:28,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:27:28,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:27:28,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:27:28,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:27:28,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:27:28,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:27:28,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:27:28,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:27:28,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:27:28,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:27:28,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:27:28,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:27:28,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:27:28,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:27:28,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:27:28,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:27:28,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:27:28,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:27:28,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:27:28,572 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-RepeatedVariableLbe.epf [2021-03-25 04:27:28,607 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:27:28,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:27:28,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:27:28,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:27:28,611 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:27:28,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:27:28,611 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:27:28,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:27:28,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:27:28,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:27:28,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:27:28,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:27:28,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:27:28,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:27:28,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:27:28,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:27:28,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:27:28,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:27:28,615 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:27:28,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:27:28,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:27:28,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:27:28,916 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:27:28,916 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:27:28,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.i [2021-03-25 04:27:28,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b106c064d/023364f923574cfba885b471f2b6b943/FLAG96f080993 [2021-03-25 04:27:29,467 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:27:29,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.i [2021-03-25 04:27:29,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b106c064d/023364f923574cfba885b471f2b6b943/FLAG96f080993 [2021-03-25 04:27:29,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b106c064d/023364f923574cfba885b471f2b6b943 [2021-03-25 04:27:29,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:27:29,966 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:27:29,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:27:29,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:27:29,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:27:29,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:27:29" (1/1) ... [2021-03-25 04:27:29,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de15db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:29, skipping insertion in model container [2021-03-25 04:27:29,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:27:29" (1/1) ... [2021-03-25 04:27:29,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:27:30,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:27:30,145 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/mix003_rmo.opt.i[948,961] [2021-03-25 04:27:30,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:27:30,331 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:27:30,340 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/mix003_rmo.opt.i[948,961] [2021-03-25 04:27:30,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:27:30,478 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:27:30,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30 WrapperNode [2021-03-25 04:27:30,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:27:30,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:27:30,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:27:30,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:27:30,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:27:30,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:27:30,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:27:30,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:27:30,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... [2021-03-25 04:27:30,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:27:30,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:27:30,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:27:30,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:27:30,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:27:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:27:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:27:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:27:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:27:30,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:27:30,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:27:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:27:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:27:30,675 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:27:30,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:27:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:27:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:27:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:27:30,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:27:30,677 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:27:32,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:27:32,548 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:27:32,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:27:32 BoogieIcfgContainer [2021-03-25 04:27:32,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:27:32,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:27:32,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:27:32,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:27:32,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:27:29" (1/3) ... [2021-03-25 04:27:32,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88bc6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:27:32, skipping insertion in model container [2021-03-25 04:27:32,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:27:30" (2/3) ... [2021-03-25 04:27:32,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88bc6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:27:32, skipping insertion in model container [2021-03-25 04:27:32,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:27:32" (3/3) ... [2021-03-25 04:27:32,557 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.i [2021-03-25 04:27:32,562 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:27:32,566 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:27:32,566 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:27:32,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,609 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,616 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,617 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,620 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,631 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,666 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:27:32,671 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:27:32,684 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:27:32,700 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:27:32,701 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:27:32,701 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:27:32,701 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:27:32,701 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:27:32,701 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:27:32,701 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:27:32,701 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:27:32,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 04:27:32,741 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 04:27:32,741 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:32,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:27:32,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 04:27:32,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-25 04:27:32,750 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:32,757 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 04:27:32,759 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 04:27:32,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-25 04:27:32,777 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 04:27:32,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:32,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 04:27:32,780 INFO L142 LiptonReduction]: Number of co-enabled transitions 1658 [2021-03-25 04:27:33,829 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:27:34,289 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:27:34,438 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:27:35,227 INFO L154 LiptonReduction]: Checked pairs total: 2749 [2021-03-25 04:27:35,227 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 04:27:35,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2480 [2021-03-25 04:27:35,239 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:27:35,239 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:35,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:35,240 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:35,241 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:35,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:35,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1737790905, now seen corresponding path program 1 times [2021-03-25 04:27:35,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:35,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301675008] [2021-03-25 04:27:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:35,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:35,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:35,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:35,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:35,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301675008] [2021-03-25 04:27:35,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:35,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:27:35,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252808531] [2021-03-25 04:27:35,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:27:35,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:27:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:27:35,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2021-03-25 04:27:35,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:35,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:35,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2021-03-25 04:27:35,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:35,625 INFO L129 PetriNetUnfolder]: 13/99 cut-off events. [2021-03-25 04:27:35,626 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:35,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 99 events. 13/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 373 event pairs, 5 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 119. Up to 25 conditions per place. [2021-03-25 04:27:35,629 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 6 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-25 04:27:35,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 103 flow [2021-03-25 04:27:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:27:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:27:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 04:27:35,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2021-03-25 04:27:35,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 04:27:35,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 04:27:35,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:35,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 04:27:35,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:35,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:35,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:35,661 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 455 transitions. [2021-03-25 04:27:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 103 flow [2021-03-25 04:27:35,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:27:35,665 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-25 04:27:35,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-25 04:27:35,667 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 04:27:35,667 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:35,667 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 04:27:35,668 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 04:27:35,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-25 04:27:35,673 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 04:27:35,673 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:35,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:27:35,673 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 04:27:36,632 INFO L154 LiptonReduction]: Checked pairs total: 1140 [2021-03-25 04:27:36,632 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 04:27:36,632 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 965 [2021-03-25 04:27:36,633 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-25 04:27:36,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:36,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:36,634 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:36,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:27:36,634 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1004847964, now seen corresponding path program 1 times [2021-03-25 04:27:36,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:36,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557713929] [2021-03-25 04:27:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:36,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:36,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:36,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:36,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:36,732 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:27:36,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:27:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:36,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557713929] [2021-03-25 04:27:36,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:36,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:27:36,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714260712] [2021-03-25 04:27:36,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:27:36,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:27:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:27:36,741 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 180 [2021-03-25 04:27:36,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 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-03-25 04:27:36,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:36,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 180 [2021-03-25 04:27:36,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:36,776 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2021-03-25 04:27:36,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:36,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2021-03-25 04:27:36,777 INFO L132 encePairwiseOnDemand]: 176/180 looper letters, 1 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2021-03-25 04:27:36,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 78 flow [2021-03-25 04:27:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:27:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:27:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 777 transitions. [2021-03-25 04:27:36,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8633333333333333 [2021-03-25 04:27:36,779 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 777 transitions. [2021-03-25 04:27:36,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 777 transitions. [2021-03-25 04:27:36,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:36,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 777 transitions. [2021-03-25 04:27:36,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.4) internal successors, (777), 5 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:36,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:36,787 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:36,788 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 777 transitions. [2021-03-25 04:27:36,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 78 flow [2021-03-25 04:27:36,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:27:36,790 INFO L241 Difference]: Finished difference. Result has 38 places, 24 transitions, 62 flow [2021-03-25 04:27:36,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2021-03-25 04:27:36,791 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-25 04:27:36,791 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:36,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 62 flow [2021-03-25 04:27:36,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 62 flow [2021-03-25 04:27:36,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-25 04:27:36,800 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:27:36,800 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:27:36,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:27:36,802 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-25 04:27:37,056 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 04:27:37,575 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:27:37,748 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:27:38,070 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 04:27:38,227 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 04:27:38,231 INFO L154 LiptonReduction]: Checked pairs total: 738 [2021-03-25 04:27:38,231 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:27:38,231 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1440 [2021-03-25 04:27:38,232 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-25 04:27:38,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 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-03-25 04:27:38,233 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:38,233 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:38,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:27:38,233 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:38,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:38,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1063909646, now seen corresponding path program 1 times [2021-03-25 04:27:38,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:38,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801875211] [2021-03-25 04:27:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:38,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,360 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 04:27:38,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 04:27:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:38,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801875211] [2021-03-25 04:27:38,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:38,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:27:38,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139653312] [2021-03-25 04:27:38,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:27:38,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:27:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:27:38,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-03-25 04:27:38,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:38,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-03-25 04:27:38,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:38,420 INFO L129 PetriNetUnfolder]: 28/90 cut-off events. [2021-03-25 04:27:38,421 INFO L130 PetriNetUnfolder]: For 16/21 co-relation queries the response was YES. [2021-03-25 04:27:38,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 90 events. 28/90 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 309 event pairs, 14 based on Foata normal form. 5/93 useless extension candidates. Maximal degree in co-relation 165. Up to 47 conditions per place. [2021-03-25 04:27:38,423 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 8 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-25 04:27:38,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 85 flow [2021-03-25 04:27:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:27:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:27:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-25 04:27:38,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233151183970856 [2021-03-25 04:27:38,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-25 04:27:38,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-25 04:27:38,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:38,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-25 04:27:38,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,428 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 452 transitions. [2021-03-25 04:27:38,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 85 flow [2021-03-25 04:27:38,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 79 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:27:38,429 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-25 04:27:38,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-25 04:27:38,430 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -17 predicate places. [2021-03-25 04:27:38,430 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:38,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-25 04:27:38,431 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-25 04:27:38,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-25 04:27:38,436 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 04:27:38,436 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 04:27:38,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:27:38,437 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-25 04:27:38,463 INFO L154 LiptonReduction]: Checked pairs total: 411 [2021-03-25 04:27:38,464 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:27:38,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-03-25 04:27:38,469 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-03-25 04:27:38,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:38,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:38,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:27:38,470 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash -983304631, now seen corresponding path program 1 times [2021-03-25 04:27:38,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:38,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663615294] [2021-03-25 04:27:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:38,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:38,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663615294] [2021-03-25 04:27:38,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:38,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:27:38,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103477278] [2021-03-25 04:27:38,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:27:38,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:27:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:27:38,612 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184 [2021-03-25 04:27:38,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:38,613 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184 [2021-03-25 04:27:38,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:38,654 INFO L129 PetriNetUnfolder]: 28/78 cut-off events. [2021-03-25 04:27:38,655 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 04:27:38,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 78 events. 28/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 275 event pairs, 12 based on Foata normal form. 8/81 useless extension candidates. Maximal degree in co-relation 154. Up to 45 conditions per place. [2021-03-25 04:27:38,658 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 5 selfloop transitions, 4 changer transitions 7/30 dead transitions. [2021-03-25 04:27:38,658 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 110 flow [2021-03-25 04:27:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:27:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:27:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 768 transitions. [2021-03-25 04:27:38,660 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8347826086956521 [2021-03-25 04:27:38,660 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 768 transitions. [2021-03-25 04:27:38,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 768 transitions. [2021-03-25 04:27:38,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:38,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 768 transitions. [2021-03-25 04:27:38,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,665 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,665 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 768 transitions. [2021-03-25 04:27:38,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 110 flow [2021-03-25 04:27:38,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:27:38,667 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 90 flow [2021-03-25 04:27:38,667 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-03-25 04:27:38,667 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-25 04:27:38,667 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:38,667 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 90 flow [2021-03-25 04:27:38,667 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 90 flow [2021-03-25 04:27:38,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 90 flow [2021-03-25 04:27:38,677 INFO L129 PetriNetUnfolder]: 23/65 cut-off events. [2021-03-25 04:27:38,677 INFO L130 PetriNetUnfolder]: For 39/44 co-relation queries the response was YES. [2021-03-25 04:27:38,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 65 events. 23/65 cut-off events. For 39/44 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 210 event pairs, 11 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 164. Up to 38 conditions per place. [2021-03-25 04:27:38,678 INFO L142 LiptonReduction]: Number of co-enabled transitions 196 [2021-03-25 04:27:38,680 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-25 04:27:38,680 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:27:38,680 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 04:27:38,681 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 90 flow [2021-03-25 04:27:38,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,681 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:38,681 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:38,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:27:38,682 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:38,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:38,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1036591910, now seen corresponding path program 1 times [2021-03-25 04:27:38,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:38,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270695246] [2021-03-25 04:27:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:38,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:38,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270695246] [2021-03-25 04:27:38,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:38,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:27:38,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236831607] [2021-03-25 04:27:38,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:27:38,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:38,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:27:38,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:27:38,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184 [2021-03-25 04:27:38,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:38,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184 [2021-03-25 04:27:38,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:38,800 INFO L129 PetriNetUnfolder]: 16/56 cut-off events. [2021-03-25 04:27:38,800 INFO L130 PetriNetUnfolder]: For 52/91 co-relation queries the response was YES. [2021-03-25 04:27:38,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 56 events. 16/56 cut-off events. For 52/91 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 145 event pairs, 2 based on Foata normal form. 14/68 useless extension candidates. Maximal degree in co-relation 175. Up to 35 conditions per place. [2021-03-25 04:27:38,801 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 5 selfloop transitions, 7 changer transitions 7/33 dead transitions. [2021-03-25 04:27:38,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 186 flow [2021-03-25 04:27:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:27:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:27:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 921 transitions. [2021-03-25 04:27:38,804 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8342391304347826 [2021-03-25 04:27:38,804 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 921 transitions. [2021-03-25 04:27:38,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 921 transitions. [2021-03-25 04:27:38,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:38,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 921 transitions. [2021-03-25 04:27:38,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.5) internal successors, (921), 6 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 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-03-25 04:27:38,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 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-03-25 04:27:38,809 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 90 flow. Second operand 6 states and 921 transitions. [2021-03-25 04:27:38,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 186 flow [2021-03-25 04:27:38,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:27:38,811 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 140 flow [2021-03-25 04:27:38,811 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-25 04:27:38,811 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -9 predicate places. [2021-03-25 04:27:38,811 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:38,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 140 flow [2021-03-25 04:27:38,812 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 140 flow [2021-03-25 04:27:38,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 140 flow [2021-03-25 04:27:38,817 INFO L129 PetriNetUnfolder]: 11/44 cut-off events. [2021-03-25 04:27:38,817 INFO L130 PetriNetUnfolder]: For 78/96 co-relation queries the response was YES. [2021-03-25 04:27:38,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 44 events. 11/44 cut-off events. For 78/96 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 2 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 142. Up to 23 conditions per place. [2021-03-25 04:27:38,818 INFO L142 LiptonReduction]: Number of co-enabled transitions 196 [2021-03-25 04:27:38,820 INFO L154 LiptonReduction]: Checked pairs total: 167 [2021-03-25 04:27:38,820 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:27:38,820 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 04:27:38,821 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 140 flow [2021-03-25 04:27:38,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:38,821 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:38,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:27:38,821 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:38,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:38,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1618160661, now seen corresponding path program 1 times [2021-03-25 04:27:38,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:38,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381820907] [2021-03-25 04:27:38,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:38,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:38,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:38,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:38,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381820907] [2021-03-25 04:27:38,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:38,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:27:38,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268494609] [2021-03-25 04:27:38,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:27:38,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:27:38,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:27:38,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 184 [2021-03-25 04:27:38,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:38,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 184 [2021-03-25 04:27:38,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:38,947 INFO L129 PetriNetUnfolder]: 7/35 cut-off events. [2021-03-25 04:27:38,947 INFO L130 PetriNetUnfolder]: For 100/145 co-relation queries the response was YES. [2021-03-25 04:27:38,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 35 events. 7/35 cut-off events. For 100/145 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 16/50 useless extension candidates. Maximal degree in co-relation 126. Up to 20 conditions per place. [2021-03-25 04:27:38,947 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 2 selfloop transitions, 10 changer transitions 4/30 dead transitions. [2021-03-25 04:27:38,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 208 flow [2021-03-25 04:27:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:27:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:27:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1068 transitions. [2021-03-25 04:27:38,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8291925465838509 [2021-03-25 04:27:38,950 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1068 transitions. [2021-03-25 04:27:38,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1068 transitions. [2021-03-25 04:27:38,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:38,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1068 transitions. [2021-03-25 04:27:38,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.57142857142858) internal successors, (1068), 7 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,955 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:38,955 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 140 flow. Second operand 7 states and 1068 transitions. [2021-03-25 04:27:38,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 208 flow [2021-03-25 04:27:38,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 164 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-25 04:27:38,958 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 134 flow [2021-03-25 04:27:38,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-25 04:27:38,959 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2021-03-25 04:27:38,959 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:38,959 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 134 flow [2021-03-25 04:27:38,959 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 134 flow [2021-03-25 04:27:38,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 134 flow [2021-03-25 04:27:38,963 INFO L129 PetriNetUnfolder]: 5/29 cut-off events. [2021-03-25 04:27:38,963 INFO L130 PetriNetUnfolder]: For 38/44 co-relation queries the response was YES. [2021-03-25 04:27:38,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 29 events. 5/29 cut-off events. For 38/44 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 74. Up to 11 conditions per place. [2021-03-25 04:27:38,964 INFO L142 LiptonReduction]: Number of co-enabled transitions 148 [2021-03-25 04:27:39,234 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 04:27:39,382 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 04:27:39,578 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-25 04:27:39,746 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 04:27:39,900 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 04:27:39,904 INFO L154 LiptonReduction]: Checked pairs total: 480 [2021-03-25 04:27:39,904 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:27:39,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 945 [2021-03-25 04:27:39,905 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 130 flow [2021-03-25 04:27:39,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:39,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:39,905 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:39,905 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:27:39,905 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash -363647429, now seen corresponding path program 1 times [2021-03-25 04:27:39,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:39,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741013910] [2021-03-25 04:27:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:39,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:39,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:39,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:39,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:39,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:39,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:39,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741013910] [2021-03-25 04:27:39,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:39,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:27:39,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422570732] [2021-03-25 04:27:39,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:27:39,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:27:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:27:39,959 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 186 [2021-03-25 04:27:39,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:39,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:39,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 186 [2021-03-25 04:27:39,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:39,979 INFO L129 PetriNetUnfolder]: 10/41 cut-off events. [2021-03-25 04:27:39,979 INFO L130 PetriNetUnfolder]: For 95/123 co-relation queries the response was YES. [2021-03-25 04:27:39,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 41 events. 10/41 cut-off events. For 95/123 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 4/38 useless extension candidates. Maximal degree in co-relation 123. Up to 20 conditions per place. [2021-03-25 04:27:39,980 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 3 selfloop transitions, 1 changer transitions 1/25 dead transitions. [2021-03-25 04:27:39,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 25 transitions, 142 flow [2021-03-25 04:27:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:27:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:27:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2021-03-25 04:27:39,982 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8360215053763441 [2021-03-25 04:27:39,982 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2021-03-25 04:27:39,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2021-03-25 04:27:39,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:39,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2021-03-25 04:27:39,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:39,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:39,985 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:39,985 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 130 flow. Second operand 4 states and 622 transitions. [2021-03-25 04:27:39,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 25 transitions, 142 flow [2021-03-25 04:27:39,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 104 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-25 04:27:39,987 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 99 flow [2021-03-25 04:27:39,987 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-25 04:27:39,987 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-25 04:27:39,987 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:39,987 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 99 flow [2021-03-25 04:27:39,987 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 99 flow [2021-03-25 04:27:39,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 99 flow [2021-03-25 04:27:39,992 INFO L129 PetriNetUnfolder]: 6/32 cut-off events. [2021-03-25 04:27:39,992 INFO L130 PetriNetUnfolder]: For 22/24 co-relation queries the response was YES. [2021-03-25 04:27:39,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 32 events. 6/32 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2021-03-25 04:27:39,993 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-25 04:27:40,620 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 180 [2021-03-25 04:27:40,898 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 04:27:42,195 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 304 DAG size of output: 259 [2021-03-25 04:27:42,718 WARN L205 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:27:42,729 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-25 04:27:42,729 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:27:42,729 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2742 [2021-03-25 04:27:42,734 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 97 flow [2021-03-25 04:27:42,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:42,735 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:42,735 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:42,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:27:42,735 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash -862328428, now seen corresponding path program 1 times [2021-03-25 04:27:42,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:42,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909977620] [2021-03-25 04:27:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:42,955 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-03-25 04:27:42,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 04:27:42,993 INFO L142 QuantifierPusher]: treesize reduction 27, result has 76.7 percent of original size [2021-03-25 04:27:42,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-03-25 04:27:43,040 INFO L142 QuantifierPusher]: treesize reduction 73, result has 70.4 percent of original size [2021-03-25 04:27:43,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 174 [2021-03-25 04:27:43,140 INFO L142 QuantifierPusher]: treesize reduction 104, result has 63.3 percent of original size [2021-03-25 04:27:43,142 INFO L147 QuantifierPusher]: treesize reduction 9, result has 95.0 percent of original size 170 [2021-03-25 04:27:43,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:43,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 04:27:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:43,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909977620] [2021-03-25 04:27:43,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:43,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:27:43,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300300521] [2021-03-25 04:27:43,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:27:43,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:43,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:27:43,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:27:43,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 187 [2021-03-25 04:27:43,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:43,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:43,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 187 [2021-03-25 04:27:43,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:43,408 INFO L129 PetriNetUnfolder]: 16/59 cut-off events. [2021-03-25 04:27:43,408 INFO L130 PetriNetUnfolder]: For 169/193 co-relation queries the response was YES. [2021-03-25 04:27:43,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 59 events. 16/59 cut-off events. For 169/193 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 156 event pairs, 0 based on Foata normal form. 13/65 useless extension candidates. Maximal degree in co-relation 146. Up to 18 conditions per place. [2021-03-25 04:27:43,408 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 3 selfloop transitions, 5 changer transitions 1/26 dead transitions. [2021-03-25 04:27:43,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 26 transitions, 130 flow [2021-03-25 04:27:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:27:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:27:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 906 transitions. [2021-03-25 04:27:43,411 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.692131398013751 [2021-03-25 04:27:43,411 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 906 transitions. [2021-03-25 04:27:43,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 906 transitions. [2021-03-25 04:27:43,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:43,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 906 transitions. [2021-03-25 04:27:43,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:43,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:43,416 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:43,416 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 97 flow. Second operand 7 states and 906 transitions. [2021-03-25 04:27:43,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 26 transitions, 130 flow [2021-03-25 04:27:43,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 26 transitions, 124 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:27:43,417 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 108 flow [2021-03-25 04:27:43,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-25 04:27:43,417 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 04:27:43,417 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:43,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 108 flow [2021-03-25 04:27:43,418 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 108 flow [2021-03-25 04:27:43,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 108 flow [2021-03-25 04:27:43,423 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-25 04:27:43,423 INFO L130 PetriNetUnfolder]: For 40/47 co-relation queries the response was YES. [2021-03-25 04:27:43,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 36 events. 7/36 cut-off events. For 40/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 3/36 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2021-03-25 04:27:43,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 108 [2021-03-25 04:27:43,618 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 04:27:44,009 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2021-03-25 04:27:44,153 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-25 04:27:44,468 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:27:44,792 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:27:45,392 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 04:27:45,955 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 04:27:45,958 INFO L154 LiptonReduction]: Checked pairs total: 263 [2021-03-25 04:27:45,958 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:27:45,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2541 [2021-03-25 04:27:45,959 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 117 flow [2021-03-25 04:27:45,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:45,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:45,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:45,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:27:45,959 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826906, now seen corresponding path program 1 times [2021-03-25 04:27:45,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:45,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303534005] [2021-03-25 04:27:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:27:46,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:46,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:27:46,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:46,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:46,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:27:46,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:27:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:27:46,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303534005] [2021-03-25 04:27:46,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:27:46,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:27:46,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342474712] [2021-03-25 04:27:46,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:27:46,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:27:46,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:27:46,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:27:46,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 190 [2021-03-25 04:27:46,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:46,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:27:46,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 190 [2021-03-25 04:27:46,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:27:46,042 INFO L129 PetriNetUnfolder]: 14/69 cut-off events. [2021-03-25 04:27:46,042 INFO L130 PetriNetUnfolder]: For 139/150 co-relation queries the response was YES. [2021-03-25 04:27:46,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 69 events. 14/69 cut-off events. For 139/150 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 259 event pairs, 0 based on Foata normal form. 4/60 useless extension candidates. Maximal degree in co-relation 189. Up to 22 conditions per place. [2021-03-25 04:27:46,043 INFO L132 encePairwiseOnDemand]: 187/190 looper letters, 3 selfloop transitions, 1 changer transitions 1/24 dead transitions. [2021-03-25 04:27:46,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 24 transitions, 129 flow [2021-03-25 04:27:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:27:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:27:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2021-03-25 04:27:46,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8289473684210527 [2021-03-25 04:27:46,045 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2021-03-25 04:27:46,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2021-03-25 04:27:46,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:27:46,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2021-03-25 04:27:46,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:46,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:46,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:46,048 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 117 flow. Second operand 4 states and 630 transitions. [2021-03-25 04:27:46,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 24 transitions, 129 flow [2021-03-25 04:27:46,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 118 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-03-25 04:27:46,049 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 113 flow [2021-03-25 04:27:46,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2021-03-25 04:27:46,049 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-25 04:27:46,050 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:27:46,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 113 flow [2021-03-25 04:27:46,050 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 23 transitions, 113 flow [2021-03-25 04:27:46,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 113 flow [2021-03-25 04:27:46,057 INFO L129 PetriNetUnfolder]: 8/48 cut-off events. [2021-03-25 04:27:46,057 INFO L130 PetriNetUnfolder]: For 58/59 co-relation queries the response was YES. [2021-03-25 04:27:46,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 48 events. 8/48 cut-off events. For 58/59 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 118 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 129. Up to 14 conditions per place. [2021-03-25 04:27:46,058 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 04:27:46,294 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 04:27:46,769 WARN L205 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 94 [2021-03-25 04:27:46,911 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 04:27:47,084 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 04:27:47,460 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-25 04:27:47,578 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:27:47,581 INFO L154 LiptonReduction]: Checked pairs total: 73 [2021-03-25 04:27:47,581 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:27:47,581 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1531 [2021-03-25 04:27:47,581 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 114 flow [2021-03-25 04:27:47,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:27:47,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:27:47,582 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:27:47,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:27:47,582 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:27:47,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:27:47,582 INFO L82 PathProgramCache]: Analyzing trace with hash -79286840, now seen corresponding path program 1 times [2021-03-25 04:27:47,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:27:47,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107995520] [2021-03-25 04:27:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:27:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:27:47,618 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:27:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:27:47,662 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:27:47,711 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:27:47,711 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:27:47,711 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:27:47,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:27:47 BasicIcfg [2021-03-25 04:27:47,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:27:47,807 INFO L168 Benchmark]: Toolchain (without parser) took 17841.02 ms. Allocated memory was 333.4 MB in the beginning and 645.9 MB in the end (delta: 312.5 MB). Free memory was 296.1 MB in the beginning and 412.8 MB in the end (delta: -116.7 MB). Peak memory consumption was 197.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,807 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 333.4 MB. Free memory was 314.5 MB in the beginning and 314.5 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:27:47,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.08 ms. Allocated memory is still 333.4 MB. Free memory was 295.9 MB in the beginning and 293.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.62 ms. Allocated memory is still 333.4 MB. Free memory was 293.0 MB in the beginning and 289.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,808 INFO L168 Benchmark]: Boogie Preprocessor took 48.00 ms. Allocated memory is still 333.4 MB. Free memory was 289.8 MB in the beginning and 286.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,808 INFO L168 Benchmark]: RCFGBuilder took 1940.48 ms. Allocated memory is still 333.4 MB. Free memory was 286.7 MB in the beginning and 167.9 MB in the end (delta: 118.8 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,808 INFO L168 Benchmark]: TraceAbstraction took 15254.10 ms. Allocated memory was 333.4 MB in the beginning and 645.9 MB in the end (delta: 312.5 MB). Free memory was 167.9 MB in the beginning and 412.8 MB in the end (delta: -244.9 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:27:47,809 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.52 ms. Allocated memory is still 333.4 MB. Free memory was 314.5 MB in the beginning and 314.5 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 514.08 ms. Allocated memory is still 333.4 MB. Free memory was 295.9 MB in the beginning and 293.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.62 ms. Allocated memory is still 333.4 MB. Free memory was 293.0 MB in the beginning and 289.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.00 ms. Allocated memory is still 333.4 MB. Free memory was 289.8 MB in the beginning and 286.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1940.48 ms. Allocated memory is still 333.4 MB. Free memory was 286.7 MB in the beginning and 167.9 MB in the end (delta: 118.8 MB). Peak memory consumption was 148.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15254.10 ms. Allocated memory was 333.4 MB in the beginning and 645.9 MB in the end (delta: 312.5 MB). Free memory was 167.9 MB in the beginning and 412.8 MB in the end (delta: -244.9 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2468.1ms, 106 PlacesBefore, 49 PlacesAfterwards, 98 TransitionsBefore, 40 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 2749 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1707, positive: 1631, positive conditional: 0, positive unconditional: 1631, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 835, positive: 813, positive conditional: 0, positive unconditional: 813, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 835, positive: 813, positive conditional: 0, positive unconditional: 813, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1707, positive: 818, positive conditional: 0, positive unconditional: 818, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 835, unknown conditional: 0, unknown unconditional: 835] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 964.4ms, 46 PlacesBefore, 35 PlacesAfterwards, 37 TransitionsBefore, 26 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 368, positive: 295, positive conditional: 0, positive unconditional: 295, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 368, positive: 256, positive conditional: 0, positive unconditional: 256, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1439.5ms, 38 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 186, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.9ms, 32 PlacesBefore, 31 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 411 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.5ms, 36 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 40 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 92, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 92, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 945.1ms, 41 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 480 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 245, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 245, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2741.5ms, 36 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 104, positive conditional: 0, positive unconditional: 104, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 126, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2540.3ms, 39 PlacesBefore, 38 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 160, positive: 114, positive conditional: 0, positive unconditional: 114, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1530.9ms, 38 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 73 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 46, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t80; [L849] FCALL, FORK 0 pthread_create(&t80, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t81; [L851] FCALL, FORK 0 pthread_create(&t81, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t82; [L853] FCALL, FORK 0 pthread_create(&t82, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15014.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 659.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2532.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 35 SDtfs, 20 SDslu, 14 SDs, 0 SdLazy, 146 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 164.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 413.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 44, 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: 39.9ms SsaConstructionTime, 408.2ms SatisfiabilityAnalysisTime, 866.7ms InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...