/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 07:16:43,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 07:16:43,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 07:16:43,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 07:16:43,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 07:16:43,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 07:16:43,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 07:16:43,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 07:16:43,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 07:16:43,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 07:16:43,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 07:16:43,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 07:16:43,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 07:16:43,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 07:16:43,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 07:16:43,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 07:16:43,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 07:16:43,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 07:16:43,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 07:16:43,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 07:16:43,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 07:16:43,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 07:16:43,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 07:16:43,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 07:16:43,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 07:16:43,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 07:16:43,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 07:16:43,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 07:16:43,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 07:16:43,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 07:16:43,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 07:16:43,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 07:16:43,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 07:16:43,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 07:16:43,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 07:16:43,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 07:16:43,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 07:16:43,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 07:16:43,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 07:16:43,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 07:16:43,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 07:16:43,650 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-NoLbe.epf [2021-06-13 07:16:43,678 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 07:16:43,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 07:16:43,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 07:16:43,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 07:16:43,680 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 07:16:43,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 07:16:43,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 07:16:43,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 07:16:43,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 07:16:43,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 07:16:43,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 07:16:43,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 07:16:43,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 07:16:43,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 07:16:43,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 07:16:43,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:16:43,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-13 07:16:43,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-13 07:16:43,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 07:16:43,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 07:16:43,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 07:16:43,916 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-13 07:16:43,916 INFO L275 PluginConnector]: CDTParser initialized [2021-06-13 07:16:43,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2021-06-13 07:16:43,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd21d1f/0313cc6538c54acfbac00d7f09812996/FLAG12918acb7 [2021-06-13 07:16:44,385 INFO L306 CDTParser]: Found 1 translation units. [2021-06-13 07:16:44,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2021-06-13 07:16:44,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd21d1f/0313cc6538c54acfbac00d7f09812996/FLAG12918acb7 [2021-06-13 07:16:44,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bcd21d1f/0313cc6538c54acfbac00d7f09812996 [2021-06-13 07:16:44,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 07:16:44,699 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-13 07:16:44,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-13 07:16:44,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-13 07:16:44,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-13 07:16:44,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:16:44" (1/1) ... [2021-06-13 07:16:44,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39d275d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:44, skipping insertion in model container [2021-06-13 07:16:44,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:16:44" (1/1) ... [2021-06-13 07:16:44,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-13 07:16:44,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-13 07:16:44,833 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i[993,1006] [2021-06-13 07:16:45,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:16:45,016 INFO L203 MainTranslator]: Completed pre-run [2021-06-13 07:16:45,025 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i[993,1006] [2021-06-13 07:16:45,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:16:45,116 INFO L208 MainTranslator]: Completed translation [2021-06-13 07:16:45,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45 WrapperNode [2021-06-13 07:16:45,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-13 07:16:45,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 07:16:45,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 07:16:45,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 07:16:45,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 07:16:45,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 07:16:45,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 07:16:45,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 07:16:45,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... [2021-06-13 07:16:45,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 07:16:45,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 07:16:45,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 07:16:45,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 07:16:45,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:16:45,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-13 07:16:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-13 07:16:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-13 07:16:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-13 07:16:45,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-13 07:16:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-13 07:16:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-13 07:16:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-13 07:16:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-13 07:16:45,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-13 07:16:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-13 07:16:45,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-13 07:16:45,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 07:16:45,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 07:16:45,259 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 07:16:46,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 07:16:46,416 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-13 07:16:46,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:16:46 BoogieIcfgContainer [2021-06-13 07:16:46,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 07:16:46,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 07:16:46,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 07:16:46,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 07:16:46,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.06 07:16:44" (1/3) ... [2021-06-13 07:16:46,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba85aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:16:46, skipping insertion in model container [2021-06-13 07:16:46,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:16:45" (2/3) ... [2021-06-13 07:16:46,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba85aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:16:46, skipping insertion in model container [2021-06-13 07:16:46,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:16:46" (3/3) ... [2021-06-13 07:16:46,425 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2021-06-13 07:16:46,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 07:16:46,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 07:16:46,430 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,476 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,478 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,489 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:16:46,496 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 07:16:46,511 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:16:46,524 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:16:46,524 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:16:46,524 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:16:46,525 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:16:46,525 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:16:46,525 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:16:46,525 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:16:46,525 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-13 07:16:46,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,565 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-06-13 07:16:46,566 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-06-13 07:16:46,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2021-06-13 07:16:46,577 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-13 07:16:46,577 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,578 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-13 07:16:46,579 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:16:46,580 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:16:46,581 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:16:46,581 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:16:46,581 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:16:46,581 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:16:46,581 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:16:46,581 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:16:46,581 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2======== [2021-06-13 07:16:46,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,598 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-06-13 07:16:46,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-06-13 07:16:46,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2021-06-13 07:16:46,608 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2021-06-13 07:16:46,608 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,608 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:46,609 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:46,609 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 751707315, now seen corresponding path program 1 times [2021-06-13 07:16:46,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:46,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686937189] [2021-06-13 07:16:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:46,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:46,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:46,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:46,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:46,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:46,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686937189] [2021-06-13 07:16:46,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686937189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:46,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:46,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 07:16:46,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97636276] [2021-06-13 07:16:46,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 07:16:46,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 07:16:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 07:16:46,823 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 111 [2021-06-13 07:16:46,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:46,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:46,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 111 [2021-06-13 07:16:46,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:46,902 INFO L129 PetriNetUnfolder]: 29/229 cut-off events. [2021-06-13 07:16:46,903 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 229 events. 29/229 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 769 event pairs, 15 based on Foata normal form. 16/231 useless extension candidates. Maximal degree in co-relation 242. Up to 41 conditions per place. [2021-06-13 07:16:46,905 INFO L132 encePairwiseOnDemand]: 106/111 looper letters, 0 selfloop transitions, 0 changer transitions 107/107 dead transitions. [2021-06-13 07:16:46,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 241 flow [2021-06-13 07:16:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 07:16:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-13 07:16:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2021-06-13 07:16:46,917 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9519519519519519 [2021-06-13 07:16:46,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2021-06-13 07:16:46,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2021-06-13 07:16:46,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:46,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2021-06-13 07:16:46,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:46,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:46,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:46,933 INFO L185 Difference]: Start difference. First operand has 116 places, 108 transitions, 225 flow. Second operand 3 states and 317 transitions. [2021-06-13 07:16:46,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 107 transitions, 241 flow [2021-06-13 07:16:46,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 107 transitions, 238 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:16:46,937 INFO L241 Difference]: Finished difference. Result has 113 places, 0 transitions, 0 flow [2021-06-13 07:16:46,938 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=113, PETRI_TRANSITIONS=0} [2021-06-13 07:16:46,938 INFO L335 CegarLoopForPetriNet]: 116 programPoint places, -3 predicate places. [2021-06-13 07:16:46,938 INFO L482 AbstractCegarLoop]: Abstraction has has 113 places, 0 transitions, 0 flow [2021-06-13 07:16:46,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:46,939 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 07:16:46,939 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3) [2021-06-13 07:16:46,940 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-13 07:16:46,941 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:16:46,941 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:16:46,941 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:16:46,941 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:16:46,941 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:16:46,941 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:16:46,941 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:16:46,941 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 07:16:46,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,949 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-06-13 07:16:46,950 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-06-13 07:16:46,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2021-06-13 07:16:46,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 96 transitions, 201 flow [2021-06-13 07:16:46,956 INFO L129 PetriNetUnfolder]: 1/95 cut-off events. [2021-06-13 07:16:46,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:46,956 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:46,956 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:46,956 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1108477602, now seen corresponding path program 1 times [2021-06-13 07:16:46,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:46,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006751458] [2021-06-13 07:16:46,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:47,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,076 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:16:47,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:16:47,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:47,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:47,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:47,103 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:47,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006751458] [2021-06-13 07:16:47,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006751458] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:47,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:47,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:16:47,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554368677] [2021-06-13 07:16:47,103 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:16:47,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:16:47,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:16:47,105 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 111 [2021-06-13 07:16:47,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:47,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 111 [2021-06-13 07:16:47,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:47,205 INFO L129 PetriNetUnfolder]: 3/111 cut-off events. [2021-06-13 07:16:47,205 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:16:47,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 111 events. 3/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 113 event pairs, 0 based on Foata normal form. 4/113 useless extension candidates. Maximal degree in co-relation 89. Up to 7 conditions per place. [2021-06-13 07:16:47,206 INFO L132 encePairwiseOnDemand]: 104/111 looper letters, 6 selfloop transitions, 2 changer transitions 11/105 dead transitions. [2021-06-13 07:16:47,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 105 transitions, 255 flow [2021-06-13 07:16:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:16:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:16:47,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2021-06-13 07:16:47,208 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.913913913913914 [2021-06-13 07:16:47,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 913 transitions. [2021-06-13 07:16:47,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 913 transitions. [2021-06-13 07:16:47,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:47,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 913 transitions. [2021-06-13 07:16:47,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 111.0) internal successors, (1110), 10 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,212 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 111.0) internal successors, (1110), 10 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,212 INFO L185 Difference]: Start difference. First operand has 105 places, 96 transitions, 201 flow. Second operand 9 states and 913 transitions. [2021-06-13 07:16:47,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 105 transitions, 255 flow [2021-06-13 07:16:47,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 105 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:16:47,215 INFO L241 Difference]: Finished difference. Result has 117 places, 94 transitions, 214 flow [2021-06-13 07:16:47,215 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=117, PETRI_TRANSITIONS=94} [2021-06-13 07:16:47,215 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 12 predicate places. [2021-06-13 07:16:47,215 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 94 transitions, 214 flow [2021-06-13 07:16:47,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,216 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:47,216 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:47,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 07:16:47,216 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash -315900832, now seen corresponding path program 1 times [2021-06-13 07:16:47,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:47,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859954443] [2021-06-13 07:16:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:47,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,279 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:16:47,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:16:47,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:16:47,300 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:16:47,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:47,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:47,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:47,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859954443] [2021-06-13 07:16:47,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859954443] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:47,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:47,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:16:47,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030222203] [2021-06-13 07:16:47,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:16:47,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:16:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:16:47,314 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2021-06-13 07:16:47,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 94 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:47,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2021-06-13 07:16:47,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:47,438 INFO L129 PetriNetUnfolder]: 91/321 cut-off events. [2021-06-13 07:16:47,438 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-13 07:16:47,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 321 events. 91/321 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1398 event pairs, 2 based on Foata normal form. 8/322 useless extension candidates. Maximal degree in co-relation 518. Up to 81 conditions per place. [2021-06-13 07:16:47,442 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 10 selfloop transitions, 6 changer transitions 19/119 dead transitions. [2021-06-13 07:16:47,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 334 flow [2021-06-13 07:16:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:16:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:16:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 910 transitions. [2021-06-13 07:16:47,444 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9109109109109109 [2021-06-13 07:16:47,444 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 910 transitions. [2021-06-13 07:16:47,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 910 transitions. [2021-06-13 07:16:47,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:47,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 910 transitions. [2021-06-13 07:16:47,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.11111111111111) internal successors, (910), 9 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 111.0) internal successors, (1110), 10 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,448 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 111.0) internal successors, (1110), 10 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,448 INFO L185 Difference]: Start difference. First operand has 117 places, 94 transitions, 214 flow. Second operand 9 states and 910 transitions. [2021-06-13 07:16:47,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 334 flow [2021-06-13 07:16:47,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 119 transitions, 318 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-06-13 07:16:47,453 INFO L241 Difference]: Finished difference. Result has 116 places, 97 transitions, 254 flow [2021-06-13 07:16:47,453 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=116, PETRI_TRANSITIONS=97} [2021-06-13 07:16:47,454 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2021-06-13 07:16:47,454 INFO L482 AbstractCegarLoop]: Abstraction has has 116 places, 97 transitions, 254 flow [2021-06-13 07:16:47,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:47,455 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:47,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 07:16:47,455 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash -131300209, now seen corresponding path program 1 times [2021-06-13 07:16:47,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:47,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835337485] [2021-06-13 07:16:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:47,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,527 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:16:47,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:16:47,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:16:47,547 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:16:47,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:47,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:47,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:47,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835337485] [2021-06-13 07:16:47,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835337485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:47,556 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:47,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:16:47,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335683496] [2021-06-13 07:16:47,556 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:16:47,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:16:47,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:16:47,557 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2021-06-13 07:16:47,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 97 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:47,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2021-06-13 07:16:47,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:47,678 INFO L129 PetriNetUnfolder]: 52/230 cut-off events. [2021-06-13 07:16:47,678 INFO L130 PetriNetUnfolder]: For 291/318 co-relation queries the response was YES. [2021-06-13 07:16:47,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 230 events. 52/230 cut-off events. For 291/318 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 770 event pairs, 0 based on Foata normal form. 13/240 useless extension candidates. Maximal degree in co-relation 555. Up to 75 conditions per place. [2021-06-13 07:16:47,680 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 10 selfloop transitions, 9 changer transitions 19/122 dead transitions. [2021-06-13 07:16:47,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 507 flow [2021-06-13 07:16:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:16:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:16:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1010 transitions. [2021-06-13 07:16:47,682 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2021-06-13 07:16:47,682 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1010 transitions. [2021-06-13 07:16:47,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1010 transitions. [2021-06-13 07:16:47,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:47,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1010 transitions. [2021-06-13 07:16:47,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.0) internal successors, (1010), 10 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,686 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,686 INFO L185 Difference]: Start difference. First operand has 116 places, 97 transitions, 254 flow. Second operand 10 states and 1010 transitions. [2021-06-13 07:16:47,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 507 flow [2021-06-13 07:16:47,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 122 transitions, 483 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-13 07:16:47,691 INFO L241 Difference]: Finished difference. Result has 122 places, 100 transitions, 322 flow [2021-06-13 07:16:47,692 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=322, PETRI_PLACES=122, PETRI_TRANSITIONS=100} [2021-06-13 07:16:47,692 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 17 predicate places. [2021-06-13 07:16:47,692 INFO L482 AbstractCegarLoop]: Abstraction has has 122 places, 100 transitions, 322 flow [2021-06-13 07:16:47,692 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,692 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:47,692 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:47,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 07:16:47,692 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 487642573, now seen corresponding path program 1 times [2021-06-13 07:16:47,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:47,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457087613] [2021-06-13 07:16:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:47,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:47,780 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:16:47,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:16:47,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:16:47,799 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:16:47,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:47,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:47,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:47,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:47,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457087613] [2021-06-13 07:16:47,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457087613] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:47,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:47,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:16:47,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363370112] [2021-06-13 07:16:47,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:16:47,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:16:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:16:47,810 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2021-06-13 07:16:47,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 100 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:47,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2021-06-13 07:16:47,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:47,932 INFO L129 PetriNetUnfolder]: 16/140 cut-off events. [2021-06-13 07:16:47,932 INFO L130 PetriNetUnfolder]: For 377/428 co-relation queries the response was YES. [2021-06-13 07:16:47,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 140 events. 16/140 cut-off events. For 377/428 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 0 based on Foata normal form. 16/154 useless extension candidates. Maximal degree in co-relation 354. Up to 30 conditions per place. [2021-06-13 07:16:47,933 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 4 selfloop transitions, 12 changer transitions 13/113 dead transitions. [2021-06-13 07:16:47,933 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 113 transitions, 506 flow [2021-06-13 07:16:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-13 07:16:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-13 07:16:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1098 transitions. [2021-06-13 07:16:47,935 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8992628992628993 [2021-06-13 07:16:47,935 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1098 transitions. [2021-06-13 07:16:47,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1098 transitions. [2021-06-13 07:16:47,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:47,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1098 transitions. [2021-06-13 07:16:47,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.81818181818181) internal successors, (1098), 11 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,940 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,940 INFO L185 Difference]: Start difference. First operand has 122 places, 100 transitions, 322 flow. Second operand 11 states and 1098 transitions. [2021-06-13 07:16:47,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 113 transitions, 506 flow [2021-06-13 07:16:47,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 407 flow, removed 39 selfloop flow, removed 10 redundant places. [2021-06-13 07:16:47,943 INFO L241 Difference]: Finished difference. Result has 124 places, 100 transitions, 308 flow [2021-06-13 07:16:47,944 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=308, PETRI_PLACES=124, PETRI_TRANSITIONS=100} [2021-06-13 07:16:47,944 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 19 predicate places. [2021-06-13 07:16:47,944 INFO L482 AbstractCegarLoop]: Abstraction has has 124 places, 100 transitions, 308 flow [2021-06-13 07:16:47,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:47,944 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:47,944 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:47,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 07:16:47,945 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:47,945 INFO L82 PathProgramCache]: Analyzing trace with hash -588979241, now seen corresponding path program 1 times [2021-06-13 07:16:47,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:47,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720090433] [2021-06-13 07:16:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:48,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,046 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:16:48,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:16:48,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:48,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:48,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720090433] [2021-06-13 07:16:48,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720090433] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:48,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:48,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:16:48,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800441160] [2021-06-13 07:16:48,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:16:48,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:48,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:16:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:16:48,075 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2021-06-13 07:16:48,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 100 transitions, 308 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:48,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2021-06-13 07:16:48,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:48,139 INFO L129 PetriNetUnfolder]: 10/148 cut-off events. [2021-06-13 07:16:48,139 INFO L130 PetriNetUnfolder]: For 134/142 co-relation queries the response was YES. [2021-06-13 07:16:48,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 148 events. 10/148 cut-off events. For 134/142 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 1/146 useless extension candidates. Maximal degree in co-relation 255. Up to 21 conditions per place. [2021-06-13 07:16:48,140 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 1 changer transitions 5/105 dead transitions. [2021-06-13 07:16:48,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 105 transitions, 348 flow [2021-06-13 07:16:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-13 07:16:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-13 07:16:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2021-06-13 07:16:48,142 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8944658944658944 [2021-06-13 07:16:48,142 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:48,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,144 INFO L185 Difference]: Start difference. First operand has 124 places, 100 transitions, 308 flow. Second operand 7 states and 695 transitions. [2021-06-13 07:16:48,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 105 transitions, 348 flow [2021-06-13 07:16:48,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 105 transitions, 266 flow, removed 22 selfloop flow, removed 15 redundant places. [2021-06-13 07:16:48,147 INFO L241 Difference]: Finished difference. Result has 116 places, 100 transitions, 239 flow [2021-06-13 07:16:48,147 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=116, PETRI_TRANSITIONS=100} [2021-06-13 07:16:48,147 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 11 predicate places. [2021-06-13 07:16:48,147 INFO L482 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 239 flow [2021-06-13 07:16:48,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,147 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:48,147 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:48,147 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 07:16:48,148 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:48,148 INFO L82 PathProgramCache]: Analyzing trace with hash 268755829, now seen corresponding path program 2 times [2021-06-13 07:16:48,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:48,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885934179] [2021-06-13 07:16:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:48,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,216 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:16:48,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:16:48,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:48,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:48,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885934179] [2021-06-13 07:16:48,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885934179] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:48,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:48,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:16:48,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317568427] [2021-06-13 07:16:48,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:16:48,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:16:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:16:48,246 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2021-06-13 07:16:48,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:48,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2021-06-13 07:16:48,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:48,308 INFO L129 PetriNetUnfolder]: 12/169 cut-off events. [2021-06-13 07:16:48,309 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-06-13 07:16:48,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 169 events. 12/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 366 event pairs, 0 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 229. Up to 16 conditions per place. [2021-06-13 07:16:48,309 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 9 selfloop transitions, 1 changer transitions 6/105 dead transitions. [2021-06-13 07:16:48,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 105 transitions, 285 flow [2021-06-13 07:16:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-13 07:16:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-13 07:16:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2021-06-13 07:16:48,311 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8944658944658944 [2021-06-13 07:16:48,311 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:48,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2021-06-13 07:16:48,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,313 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 111.0) internal successors, (888), 8 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,313 INFO L185 Difference]: Start difference. First operand has 116 places, 100 transitions, 239 flow. Second operand 7 states and 695 transitions. [2021-06-13 07:16:48,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 105 transitions, 285 flow [2021-06-13 07:16:48,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 105 transitions, 270 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-13 07:16:48,315 INFO L241 Difference]: Finished difference. Result has 118 places, 99 transitions, 241 flow [2021-06-13 07:16:48,315 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=118, PETRI_TRANSITIONS=99} [2021-06-13 07:16:48,315 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 13 predicate places. [2021-06-13 07:16:48,315 INFO L482 AbstractCegarLoop]: Abstraction has has 118 places, 99 transitions, 241 flow [2021-06-13 07:16:48,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,316 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:48,316 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:48,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 07:16:48,316 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -273091077, now seen corresponding path program 3 times [2021-06-13 07:16:48,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:48,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165204963] [2021-06-13 07:16:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:48,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,377 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.5 percent of original size [2021-06-13 07:16:48,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-13 07:16:48,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:16:48,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,402 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:16:48,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:16:48,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:48,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:48,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165204963] [2021-06-13 07:16:48,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165204963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:48,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:48,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-13 07:16:48,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355832786] [2021-06-13 07:16:48,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-13 07:16:48,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-13 07:16:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-13 07:16:48,436 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 111 [2021-06-13 07:16:48,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 99 transitions, 241 flow. Second operand has 9 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:48,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 111 [2021-06-13 07:16:48,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:48,583 INFO L129 PetriNetUnfolder]: 25/240 cut-off events. [2021-06-13 07:16:48,584 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-13 07:16:48,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 240 events. 25/240 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 812 event pairs, 2 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 357. Up to 27 conditions per place. [2021-06-13 07:16:48,585 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 16 selfloop transitions, 5 changer transitions 8/110 dead transitions. [2021-06-13 07:16:48,585 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 110 transitions, 327 flow [2021-06-13 07:16:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:16:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:16:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2021-06-13 07:16:48,587 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8198198198198198 [2021-06-13 07:16:48,587 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2021-06-13 07:16:48,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2021-06-13 07:16:48,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:48,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2021-06-13 07:16:48,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,590 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,590 INFO L185 Difference]: Start difference. First operand has 118 places, 99 transitions, 241 flow. Second operand 10 states and 910 transitions. [2021-06-13 07:16:48,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 110 transitions, 327 flow [2021-06-13 07:16:48,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 312 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-13 07:16:48,592 INFO L241 Difference]: Finished difference. Result has 123 places, 101 transitions, 263 flow [2021-06-13 07:16:48,592 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=263, PETRI_PLACES=123, PETRI_TRANSITIONS=101} [2021-06-13 07:16:48,592 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2021-06-13 07:16:48,592 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 101 transitions, 263 flow [2021-06-13 07:16:48,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,593 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:48,593 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:48,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 07:16:48,593 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -596749427, now seen corresponding path program 4 times [2021-06-13 07:16:48,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:48,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728603101] [2021-06-13 07:16:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:16:48,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:16:48,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-13 07:16:48,688 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.1 percent of original size [2021-06-13 07:16:48,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-06-13 07:16:48,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-13 07:16:48,724 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-13 07:16:48,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-13 07:16:48,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:16:48,745 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:16:48,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:16:48,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:16:48,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:16:48,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:16:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:16:48,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:16:48,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728603101] [2021-06-13 07:16:48,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728603101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:16:48,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:16:48,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-13 07:16:48,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471499111] [2021-06-13 07:16:48,784 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-13 07:16:48,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:16:48,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-13 07:16:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-13 07:16:48,786 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 111 [2021-06-13 07:16:48,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 101 transitions, 263 flow. Second operand has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:16:48,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 111 [2021-06-13 07:16:48,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:16:48,990 INFO L129 PetriNetUnfolder]: 19/207 cut-off events. [2021-06-13 07:16:48,990 INFO L130 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2021-06-13 07:16:48,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 207 events. 19/207 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 588 event pairs, 1 based on Foata normal form. 5/206 useless extension candidates. Maximal degree in co-relation 339. Up to 18 conditions per place. [2021-06-13 07:16:48,991 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 16 selfloop transitions, 6 changer transitions 7/108 dead transitions. [2021-06-13 07:16:48,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 108 transitions, 345 flow [2021-06-13 07:16:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-13 07:16:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-13 07:16:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 975 transitions. [2021-06-13 07:16:48,993 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7985257985257985 [2021-06-13 07:16:48,993 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 975 transitions. [2021-06-13 07:16:48,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 975 transitions. [2021-06-13 07:16:48,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:16:48,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 975 transitions. [2021-06-13 07:16:48,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.63636363636364) internal successors, (975), 11 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,996 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,996 INFO L185 Difference]: Start difference. First operand has 123 places, 101 transitions, 263 flow. Second operand 11 states and 975 transitions. [2021-06-13 07:16:48,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 108 transitions, 345 flow [2021-06-13 07:16:48,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 108 transitions, 326 flow, removed 7 selfloop flow, removed 6 redundant places. [2021-06-13 07:16:48,998 INFO L241 Difference]: Finished difference. Result has 127 places, 101 transitions, 274 flow [2021-06-13 07:16:48,998 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=101} [2021-06-13 07:16:48,998 INFO L335 CegarLoopForPetriNet]: 105 programPoint places, 22 predicate places. [2021-06-13 07:16:48,998 INFO L482 AbstractCegarLoop]: Abstraction has has 127 places, 101 transitions, 274 flow [2021-06-13 07:16:48,999 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 87.66666666666667) internal successors, (1052), 12 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:16:48,999 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:16:48,999 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:16:48,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-13 07:16:48,999 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:16:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:16:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1139569833, now seen corresponding path program 5 times [2021-06-13 07:16:48,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:16:48,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802789196] [2021-06-13 07:16:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:16:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:16:49,024 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:16:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:16:49,054 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:16:49,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 07:16:49,091 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 07:16:49,091 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-13 07:16:49,091 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-13 07:16:49,092 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 07:16:49,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 07:16:49 BasicIcfg [2021-06-13 07:16:49,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 07:16:49,203 INFO L168 Benchmark]: Toolchain (without parser) took 4504.47 ms. Allocated memory was 188.7 MB in the beginning and 304.1 MB in the end (delta: 115.3 MB). Free memory was 150.6 MB in the beginning and 108.6 MB in the end (delta: 42.0 MB). Peak memory consumption was 156.5 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,204 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 188.7 MB. Free memory is still 169.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 07:16:49,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.64 ms. Allocated memory is still 188.7 MB. Free memory was 150.4 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 188.7 MB. Free memory was 147.8 MB in the beginning and 145.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,204 INFO L168 Benchmark]: Boogie Preprocessor took 47.89 ms. Allocated memory is still 188.7 MB. Free memory was 145.2 MB in the beginning and 143.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,204 INFO L168 Benchmark]: RCFGBuilder took 1223.26 ms. Allocated memory was 188.7 MB in the beginning and 249.6 MB in the end (delta: 60.8 MB). Free memory was 143.2 MB in the beginning and 206.0 MB in the end (delta: -62.9 MB). Peak memory consumption was 85.3 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,205 INFO L168 Benchmark]: TraceAbstraction took 2784.11 ms. Allocated memory was 249.6 MB in the beginning and 304.1 MB in the end (delta: 54.5 MB). Free memory was 205.5 MB in the beginning and 108.6 MB in the end (delta: 96.9 MB). Peak memory consumption was 151.4 MB. Max. memory is 8.0 GB. [2021-06-13 07:16:49,205 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.08 ms. Allocated memory is still 188.7 MB. Free memory is still 169.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 415.64 ms. Allocated memory is still 188.7 MB. Free memory was 150.4 MB in the beginning and 147.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 28.86 ms. Allocated memory is still 188.7 MB. Free memory was 147.8 MB in the beginning and 145.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.89 ms. Allocated memory is still 188.7 MB. Free memory was 145.2 MB in the beginning and 143.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1223.26 ms. Allocated memory was 188.7 MB in the beginning and 249.6 MB in the end (delta: 60.8 MB). Free memory was 143.2 MB in the beginning and 206.0 MB in the end (delta: -62.9 MB). Peak memory consumption was 85.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 2784.11 ms. Allocated memory was 249.6 MB in the beginning and 304.1 MB in the end (delta: 54.5 MB). Free memory was 205.5 MB in the beginning and 108.6 MB in the end (delta: 96.9 MB). Peak memory consumption was 151.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L731] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L732] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L733] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L734] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L841] 0 pthread_t t916; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 56.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 51.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 358.8ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 119.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=0, InterpolantAutomatonStates: 3, 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: 4.3ms SsaConstructionTime, 27.4ms SatisfiabilityAnalysisTime, 106.9ms InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2150.7ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1038.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 79 SDtfs, 148 SDslu, 284 SDs, 0 SdLazy, 425 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 271.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 723.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=3, InterpolantAutomatonStates: 74, 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: 28.8ms SsaConstructionTime, 284.1ms SatisfiabilityAnalysisTime, 654.6ms InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 2176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...