/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 10:49:05,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 10:49:05,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 10:49:05,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 10:49:05,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 10:49:05,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 10:49:05,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 10:49:05,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 10:49:05,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 10:49:05,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 10:49:05,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 10:49:05,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 10:49:05,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 10:49:05,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 10:49:05,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 10:49:05,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 10:49:05,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 10:49:05,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 10:49:05,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 10:49:05,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 10:49:05,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 10:49:05,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 10:49:05,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 10:49:05,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 10:49:05,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 10:49:05,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 10:49:05,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 10:49:05,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 10:49:05,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 10:49:05,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 10:49:05,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 10:49:05,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 10:49:05,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 10:49:05,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 10:49:05,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 10:49:05,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 10:49:05,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 10:49:05,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 10:49:05,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 10:49:05,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 10:49:05,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 10:49:05,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2021-03-24 10:49:05,605 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 10:49:05,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 10:49:05,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 10:49:05,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 10:49:05,609 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 10:49:05,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 10:49:05,609 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 10:49:05,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 10:49:05,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 10:49:05,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 10:49:05,611 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 10:49:05,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 10:49:05,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 10:49:05,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 10:49:05,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 10:49:05,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 10:49:05,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:49:05,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-24 10:49:05,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 10:49:05,613 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-03-24 10:49:05,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 10:49:05,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 10:49:05,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 10:49:05,936 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 10:49:05,943 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 10:49:05,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2021-03-24 10:49:05,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854a8cacf/1a12b6f4d2f54d1dbd070b33fdbb2f3a/FLAGf085c0b25 [2021-03-24 10:49:06,439 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 10:49:06,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i [2021-03-24 10:49:06,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854a8cacf/1a12b6f4d2f54d1dbd070b33fdbb2f3a/FLAGf085c0b25 [2021-03-24 10:49:06,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854a8cacf/1a12b6f4d2f54d1dbd070b33fdbb2f3a [2021-03-24 10:49:06,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 10:49:06,733 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 10:49:06,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 10:49:06,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 10:49:06,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 10:49:06,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:49:06" (1/1) ... [2021-03-24 10:49:06,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbfeac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:06, skipping insertion in model container [2021-03-24 10:49:06,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 10:49:06" (1/1) ... [2021-03-24 10:49:06,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 10:49:06,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 10:49:06,914 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i[948,961] [2021-03-24 10:49:07,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:49:07,194 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 10:49:07,206 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.opt.i[948,961] [2021-03-24 10:49:07,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 10:49:07,330 INFO L208 MainTranslator]: Completed translation [2021-03-24 10:49:07,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07 WrapperNode [2021-03-24 10:49:07,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 10:49:07,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 10:49:07,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 10:49:07,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 10:49:07,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 10:49:07,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 10:49:07,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 10:49:07,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 10:49:07,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... [2021-03-24 10:49:07,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 10:49:07,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 10:49:07,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 10:49:07,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 10:49:07,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 10:49:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 10:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 10:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 10:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 10:49:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 10:49:07,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 10:49:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 10:49:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 10:49:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-24 10:49:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-24 10:49:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 10:49:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 10:49:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 10:49:07,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 10:49:07,549 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 10:49:09,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 10:49:09,177 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 10:49:09,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:49:09 BoogieIcfgContainer [2021-03-24 10:49:09,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 10:49:09,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 10:49:09,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 10:49:09,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 10:49:09,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 10:49:06" (1/3) ... [2021-03-24 10:49:09,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799c1847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:49:09, skipping insertion in model container [2021-03-24 10:49:09,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 10:49:07" (2/3) ... [2021-03-24 10:49:09,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799c1847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 10:49:09, skipping insertion in model container [2021-03-24 10:49:09,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 10:49:09" (3/3) ... [2021-03-24 10:49:09,187 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_tso.opt.i [2021-03-24 10:49:09,194 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 10:49:09,198 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 10:49:09,199 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,241 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,242 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,270 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,273 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 10:49:09,279 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 10:49:09,296 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-24 10:49:09,323 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 10:49:09,323 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 10:49:09,323 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 10:49:09,323 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 10:49:09,323 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 10:49:09,323 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 10:49:09,323 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 10:49:09,324 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 10:49:09,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-24 10:49:09,379 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-24 10:49:09,379 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:49:09,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-24 10:49:09,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-24 10:49:09,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-24 10:49:09,397 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-24 10:49:09,406 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-24 10:49:09,409 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-24 10:49:09,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-24 10:49:09,442 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-24 10:49:09,442 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:49:09,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-24 10:49:09,447 INFO L142 LiptonReduction]: Number of co-enabled transitions 1644 [2021-03-24 10:49:10,436 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 10:49:10,856 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-24 10:49:10,975 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-24 10:49:11,986 INFO L154 LiptonReduction]: Checked pairs total: 2442 [2021-03-24 10:49:11,986 INFO L156 LiptonReduction]: Total number of compositions: 71 [2021-03-24 10:49:11,988 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2592 [2021-03-24 10:49:12,002 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-24 10:49:12,003 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:49:12,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:12,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:12,004 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:12,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2076919861, now seen corresponding path program 1 times [2021-03-24 10:49:12,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:12,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487077171] [2021-03-24 10:49:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:12,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:12,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:12,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487077171] [2021-03-24 10:49:12,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:12,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 10:49:12,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721777743] [2021-03-24 10:49:12,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 10:49:12,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 10:49:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 10:49:12,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 172 [2021-03-24 10:49:12,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:12,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 172 [2021-03-24 10:49:12,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:12,342 INFO L129 PetriNetUnfolder]: 9/70 cut-off events. [2021-03-24 10:49:12,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:49:12,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 70 events. 9/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 178 event pairs, 3 based on Foata normal form. 5/65 useless extension candidates. Maximal degree in co-relation 82. Up to 17 conditions per place. [2021-03-24 10:49:12,344 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 5 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2021-03-24 10:49:12,344 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 95 flow [2021-03-24 10:49:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 10:49:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 10:49:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2021-03-24 10:49:12,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8972868217054264 [2021-03-24 10:49:12,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2021-03-24 10:49:12,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2021-03-24 10:49:12,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:12,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2021-03-24 10:49:12,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,384 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 463 transitions. [2021-03-24 10:49:12,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 95 flow [2021-03-24 10:49:12,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-24 10:49:12,388 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-24 10:49:12,390 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-24 10:49:12,391 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-24 10:49:12,391 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 78 flow [2021-03-24 10:49:12,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:12,392 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:12,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 10:49:12,392 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 222448920, now seen corresponding path program 1 times [2021-03-24 10:49:12,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:12,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548371681] [2021-03-24 10:49:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:12,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:12,506 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-24 10:49:12,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 10:49:12,518 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:12,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:12,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548371681] [2021-03-24 10:49:12,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:12,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:49:12,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103499258] [2021-03-24 10:49:12,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:49:12,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:12,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:49:12,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:49:12,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 172 [2021-03-24 10:49:12,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:12,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 172 [2021-03-24 10:49:12,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:12,659 INFO L129 PetriNetUnfolder]: 89/239 cut-off events. [2021-03-24 10:49:12,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 10:49:12,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 239 events. 89/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1179 event pairs, 42 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 389. Up to 106 conditions per place. [2021-03-24 10:49:12,662 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 7 selfloop transitions, 4 changer transitions 12/47 dead transitions. [2021-03-24 10:49:12,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 148 flow [2021-03-24 10:49:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:49:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:49:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2021-03-24 10:49:12,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8651162790697674 [2021-03-24 10:49:12,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2021-03-24 10:49:12,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2021-03-24 10:49:12,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:12,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2021-03-24 10:49:12,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,675 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,675 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 78 flow. Second operand 5 states and 744 transitions. [2021-03-24 10:49:12,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 148 flow [2021-03-24 10:49:12,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 10:49:12,677 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 106 flow [2021-03-24 10:49:12,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-24 10:49:12,677 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2021-03-24 10:49:12,678 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 106 flow [2021-03-24 10:49:12,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:12,678 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:12,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 10:49:12,678 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -70364225, now seen corresponding path program 1 times [2021-03-24 10:49:12,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:12,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203363219] [2021-03-24 10:49:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:12,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:12,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:12,753 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:12,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:12,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203363219] [2021-03-24 10:49:12,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:12,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 10:49:12,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379344826] [2021-03-24 10:49:12,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:49:12,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:49:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:49:12,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 172 [2021-03-24 10:49:12,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:12,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 172 [2021-03-24 10:49:12,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:12,784 INFO L129 PetriNetUnfolder]: 17/83 cut-off events. [2021-03-24 10:49:12,785 INFO L130 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2021-03-24 10:49:12,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 83 events. 17/83 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 252 event pairs, 5 based on Foata normal form. 6/85 useless extension candidates. Maximal degree in co-relation 162. Up to 35 conditions per place. [2021-03-24 10:49:12,786 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 2 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2021-03-24 10:49:12,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 130 flow [2021-03-24 10:49:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:49:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:49:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 768 transitions. [2021-03-24 10:49:12,788 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8930232558139535 [2021-03-24 10:49:12,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 768 transitions. [2021-03-24 10:49:12,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 768 transitions. [2021-03-24 10:49:12,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:12,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 768 transitions. [2021-03-24 10:49:12,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.6) internal successors, (768), 5 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,793 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,793 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 106 flow. Second operand 5 states and 768 transitions. [2021-03-24 10:49:12,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 130 flow [2021-03-24 10:49:12,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 124 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-24 10:49:12,795 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 115 flow [2021-03-24 10:49:12,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-03-24 10:49:12,795 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2021-03-24 10:49:12,795 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 115 flow [2021-03-24 10:49:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:12,796 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:12,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 10:49:12,796 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:12,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1219005839, now seen corresponding path program 1 times [2021-03-24 10:49:12,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:12,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981439515] [2021-03-24 10:49:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:12,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:12,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:12,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:12,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:12,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:12,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981439515] [2021-03-24 10:49:12,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:12,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:49:12,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550386] [2021-03-24 10:49:12,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 10:49:12,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 10:49:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 10:49:12,892 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-24 10:49:12,893 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,893 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:12,893 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-24 10:49:12,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:12,960 INFO L129 PetriNetUnfolder]: 82/209 cut-off events. [2021-03-24 10:49:12,961 INFO L130 PetriNetUnfolder]: For 80/83 co-relation queries the response was YES. [2021-03-24 10:49:12,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 209 events. 82/209 cut-off events. For 80/83 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 954 event pairs, 31 based on Foata normal form. 14/192 useless extension candidates. Maximal degree in co-relation 455. Up to 110 conditions per place. [2021-03-24 10:49:12,964 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 10 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2021-03-24 10:49:12,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 173 flow [2021-03-24 10:49:12,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:49:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:49:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-03-24 10:49:12,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488372093023255 [2021-03-24 10:49:12,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-03-24 10:49:12,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-03-24 10:49:12,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:12,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-03-24 10:49:12,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,971 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 115 flow. Second operand 5 states and 730 transitions. [2021-03-24 10:49:12,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 173 flow [2021-03-24 10:49:12,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 163 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-24 10:49:12,976 INFO L241 Difference]: Finished difference. Result has 50 places, 42 transitions, 165 flow [2021-03-24 10:49:12,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2021-03-24 10:49:12,976 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2021-03-24 10:49:12,976 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 165 flow [2021-03-24 10:49:12,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:12,977 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:12,977 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:12,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 10:49:12,977 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -935491948, now seen corresponding path program 1 times [2021-03-24 10:49:12,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:12,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10164918] [2021-03-24 10:49:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:13,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,074 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-24 10:49:13,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:13,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:13,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10164918] [2021-03-24 10:49:13,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:13,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:49:13,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930390130] [2021-03-24 10:49:13,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:49:13,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:49:13,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:49:13,086 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-24 10:49:13,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:13,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-24 10:49:13,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:13,149 INFO L129 PetriNetUnfolder]: 56/165 cut-off events. [2021-03-24 10:49:13,149 INFO L130 PetriNetUnfolder]: For 158/294 co-relation queries the response was YES. [2021-03-24 10:49:13,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 165 events. 56/165 cut-off events. For 158/294 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 675 event pairs, 5 based on Foata normal form. 49/201 useless extension candidates. Maximal degree in co-relation 506. Up to 88 conditions per place. [2021-03-24 10:49:13,151 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 8 selfloop transitions, 15 changer transitions 3/54 dead transitions. [2021-03-24 10:49:13,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 279 flow [2021-03-24 10:49:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:49:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:49:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1022 transitions. [2021-03-24 10:49:13,154 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8488372093023255 [2021-03-24 10:49:13,154 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1022 transitions. [2021-03-24 10:49:13,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1022 transitions. [2021-03-24 10:49:13,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:13,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1022 transitions. [2021-03-24 10:49:13,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,160 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,160 INFO L185 Difference]: Start difference. First operand has 50 places, 42 transitions, 165 flow. Second operand 7 states and 1022 transitions. [2021-03-24 10:49:13,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 279 flow [2021-03-24 10:49:13,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-24 10:49:13,163 INFO L241 Difference]: Finished difference. Result has 58 places, 49 transitions, 260 flow [2021-03-24 10:49:13,163 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2021-03-24 10:49:13,163 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places. [2021-03-24 10:49:13,163 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 260 flow [2021-03-24 10:49:13,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:13,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:13,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 10:49:13,164 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash 819365500, now seen corresponding path program 1 times [2021-03-24 10:49:13,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:13,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490939179] [2021-03-24 10:49:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:13,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,280 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-24 10:49:13,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:13,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:13,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490939179] [2021-03-24 10:49:13,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:13,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 10:49:13,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161476913] [2021-03-24 10:49:13,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:49:13,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:49:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:49:13,292 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2021-03-24 10:49:13,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:13,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2021-03-24 10:49:13,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:13,380 INFO L129 PetriNetUnfolder]: 44/138 cut-off events. [2021-03-24 10:49:13,380 INFO L130 PetriNetUnfolder]: For 423/613 co-relation queries the response was YES. [2021-03-24 10:49:13,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 138 events. 44/138 cut-off events. For 423/613 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 544 event pairs, 1 based on Foata normal form. 54/180 useless extension candidates. Maximal degree in co-relation 533. Up to 78 conditions per place. [2021-03-24 10:49:13,382 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 5 selfloop transitions, 19 changer transitions 4/56 dead transitions. [2021-03-24 10:49:13,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 352 flow [2021-03-24 10:49:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 10:49:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 10:49:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1308 transitions. [2021-03-24 10:49:13,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8449612403100775 [2021-03-24 10:49:13,386 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1308 transitions. [2021-03-24 10:49:13,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1308 transitions. [2021-03-24 10:49:13,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:13,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1308 transitions. [2021-03-24 10:49:13,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.33333333333334) internal successors, (1308), 9 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,393 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,393 INFO L185 Difference]: Start difference. First operand has 58 places, 49 transitions, 260 flow. Second operand 9 states and 1308 transitions. [2021-03-24 10:49:13,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 352 flow [2021-03-24 10:49:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 308 flow, removed 16 selfloop flow, removed 3 redundant places. [2021-03-24 10:49:13,399 INFO L241 Difference]: Finished difference. Result has 66 places, 50 transitions, 277 flow [2021-03-24 10:49:13,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2021-03-24 10:49:13,399 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2021-03-24 10:49:13,399 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 277 flow [2021-03-24 10:49:13,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:13,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:13,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 10:49:13,400 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1618405118, now seen corresponding path program 1 times [2021-03-24 10:49:13,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:13,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995351320] [2021-03-24 10:49:13,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:13,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,502 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-24 10:49:13,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 10:49:13,516 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:13,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:13,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995351320] [2021-03-24 10:49:13,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:13,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:49:13,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329170842] [2021-03-24 10:49:13,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:49:13,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:13,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:49:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:49:13,523 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172 [2021-03-24 10:49:13,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:13,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172 [2021-03-24 10:49:13,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:13,595 INFO L129 PetriNetUnfolder]: 53/195 cut-off events. [2021-03-24 10:49:13,596 INFO L130 PetriNetUnfolder]: For 523/578 co-relation queries the response was YES. [2021-03-24 10:49:13,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 195 events. 53/195 cut-off events. For 523/578 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1004 event pairs, 1 based on Foata normal form. 9/193 useless extension candidates. Maximal degree in co-relation 705. Up to 55 conditions per place. [2021-03-24 10:49:13,598 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 9 selfloop transitions, 11 changer transitions 1/59 dead transitions. [2021-03-24 10:49:13,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 357 flow [2021-03-24 10:49:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-24 10:49:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-24 10:49:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2021-03-24 10:49:13,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-03-24 10:49:13,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2021-03-24 10:49:13,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2021-03-24 10:49:13,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:13,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2021-03-24 10:49:13,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,605 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,605 INFO L185 Difference]: Start difference. First operand has 66 places, 50 transitions, 277 flow. Second operand 6 states and 860 transitions. [2021-03-24 10:49:13,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 357 flow [2021-03-24 10:49:13,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 283 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-03-24 10:49:13,613 INFO L241 Difference]: Finished difference. Result has 64 places, 56 transitions, 277 flow [2021-03-24 10:49:13,613 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2021-03-24 10:49:13,614 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2021-03-24 10:49:13,614 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 277 flow [2021-03-24 10:49:13,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,614 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:13,614 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:13,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 10:49:13,614 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash 556771394, now seen corresponding path program 2 times [2021-03-24 10:49:13,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:13,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980697868] [2021-03-24 10:49:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:13,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,699 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-24 10:49:13,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-24 10:49:13,711 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:13,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:13,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980697868] [2021-03-24 10:49:13,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:13,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 10:49:13,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878745919] [2021-03-24 10:49:13,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 10:49:13,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 10:49:13,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 10:49:13,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172 [2021-03-24 10:49:13,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:13,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172 [2021-03-24 10:49:13,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:13,792 INFO L129 PetriNetUnfolder]: 66/239 cut-off events. [2021-03-24 10:49:13,792 INFO L130 PetriNetUnfolder]: For 286/326 co-relation queries the response was YES. [2021-03-24 10:49:13,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 239 events. 66/239 cut-off events. For 286/326 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1393 event pairs, 2 based on Foata normal form. 19/245 useless extension candidates. Maximal degree in co-relation 786. Up to 75 conditions per place. [2021-03-24 10:49:13,794 INFO L132 encePairwiseOnDemand]: 164/172 looper letters, 8 selfloop transitions, 4 changer transitions 11/61 dead transitions. [2021-03-24 10:49:13,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 349 flow [2021-03-24 10:49:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 10:49:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 10:49:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1002 transitions. [2021-03-24 10:49:13,797 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8322259136212624 [2021-03-24 10:49:13,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1002 transitions. [2021-03-24 10:49:13,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1002 transitions. [2021-03-24 10:49:13,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:13,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1002 transitions. [2021-03-24 10:49:13,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,802 INFO L185 Difference]: Start difference. First operand has 64 places, 56 transitions, 277 flow. Second operand 7 states and 1002 transitions. [2021-03-24 10:49:13,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 349 flow [2021-03-24 10:49:13,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 347 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-24 10:49:13,807 INFO L241 Difference]: Finished difference. Result has 70 places, 49 transitions, 236 flow [2021-03-24 10:49:13,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2021-03-24 10:49:13,807 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 24 predicate places. [2021-03-24 10:49:13,807 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 236 flow [2021-03-24 10:49:13,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,808 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:13,808 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:13,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 10:49:13,808 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1698914036, now seen corresponding path program 3 times [2021-03-24 10:49:13,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:13,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116110365] [2021-03-24 10:49:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 10:49:13,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 10:49:13,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 10:49:13,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 10:49:13,879 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 10:49:13,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 10:49:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 10:49:13,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116110365] [2021-03-24 10:49:13,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 10:49:13,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 10:49:13,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96921374] [2021-03-24 10:49:13,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 10:49:13,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 10:49:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 10:49:13,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 10:49:13,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-24 10:49:13,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 10:49:13,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-24 10:49:13,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 10:49:13,947 INFO L129 PetriNetUnfolder]: 35/155 cut-off events. [2021-03-24 10:49:13,947 INFO L130 PetriNetUnfolder]: For 185/188 co-relation queries the response was YES. [2021-03-24 10:49:13,948 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 155 events. 35/155 cut-off events. For 185/188 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 782 event pairs, 1 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 485. Up to 45 conditions per place. [2021-03-24 10:49:13,948 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 5 selfloop transitions, 1 changer transitions 13/51 dead transitions. [2021-03-24 10:49:13,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 51 transitions, 264 flow [2021-03-24 10:49:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 10:49:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 10:49:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 749 transitions. [2021-03-24 10:49:13,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8709302325581395 [2021-03-24 10:49:13,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 749 transitions. [2021-03-24 10:49:13,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 749 transitions. [2021-03-24 10:49:13,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 10:49:13,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 749 transitions. [2021-03-24 10:49:13,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,955 INFO L185 Difference]: Start difference. First operand has 70 places, 49 transitions, 236 flow. Second operand 5 states and 749 transitions. [2021-03-24 10:49:13,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 51 transitions, 264 flow [2021-03-24 10:49:13,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 51 transitions, 244 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-24 10:49:13,958 INFO L241 Difference]: Finished difference. Result has 68 places, 38 transitions, 157 flow [2021-03-24 10:49:13,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2021-03-24 10:49:13,958 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2021-03-24 10:49:13,958 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 157 flow [2021-03-24 10:49:13,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 10:49:13,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 10:49:13,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 10:49:13,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 10:49:13,959 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 10:49:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 10:49:13,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2006970252, now seen corresponding path program 4 times [2021-03-24 10:49:13,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 10:49:13,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668708299] [2021-03-24 10:49:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 10:49:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:49:14,004 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:49:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 10:49:14,055 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 10:49:14,097 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 10:49:14,097 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 10:49:14,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 10:49:14,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 10:49:14 BasicIcfg [2021-03-24 10:49:14,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 10:49:14,180 INFO L168 Benchmark]: Toolchain (without parser) took 7446.73 ms. Allocated memory was 255.9 MB in the beginning and 421.5 MB in the end (delta: 165.7 MB). Free memory was 235.3 MB in the beginning and 342.5 MB in the end (delta: -107.1 MB). Peak memory consumption was 58.4 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,180 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 10:49:14,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.89 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 235.3 MB in the beginning and 309.1 MB in the end (delta: -73.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 348.1 MB. Free memory was 309.1 MB in the beginning and 306.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,181 INFO L168 Benchmark]: Boogie Preprocessor took 59.51 ms. Allocated memory is still 348.1 MB. Free memory was 306.7 MB in the beginning and 304.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,182 INFO L168 Benchmark]: RCFGBuilder took 1712.58 ms. Allocated memory is still 348.1 MB. Free memory was 304.6 MB in the beginning and 280.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,182 INFO L168 Benchmark]: TraceAbstraction took 4998.32 ms. Allocated memory was 348.1 MB in the beginning and 421.5 MB in the end (delta: 73.4 MB). Free memory was 280.1 MB in the beginning and 342.5 MB in the end (delta: -62.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.0 GB. [2021-03-24 10:49:14,184 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 595.89 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 235.3 MB in the beginning and 309.1 MB in the end (delta: -73.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 348.1 MB. Free memory was 309.1 MB in the beginning and 306.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 59.51 ms. Allocated memory is still 348.1 MB. Free memory was 306.7 MB in the beginning and 304.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1712.58 ms. Allocated memory is still 348.1 MB. Free memory was 304.6 MB in the beginning and 280.1 MB in the end (delta: 24.5 MB). Peak memory consumption was 48.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4998.32 ms. Allocated memory was 348.1 MB in the beginning and 421.5 MB in the end (delta: 73.4 MB). Free memory was 280.1 MB in the beginning and 342.5 MB in the end (delta: -62.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2577.6ms, 106 PlacesBefore, 46 PlacesAfterwards, 98 TransitionsBefore, 37 TransitionsAfterwards, 1644 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, 2442 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1470, positive: 1407, positive conditional: 0, positive unconditional: 1407, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 854, positive: 833, positive conditional: 0, positive unconditional: 833, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 854, positive: 833, positive conditional: 0, positive unconditional: 833, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1470, positive: 574, positive conditional: 0, positive unconditional: 574, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 854, unknown conditional: 0, unknown unconditional: 854] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 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] [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 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, y=0] [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t934; [L836] FCALL, FORK 0 pthread_create(&t934, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t935; [L838] FCALL, FORK 0 pthread_create(&t935, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t936; [L840] FCALL, FORK 0 pthread_create(&t936, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 [L804] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4780.3ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 814.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2669.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 53 SDtfs, 52 SDslu, 63 SDs, 0 SdLazy, 162 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 156.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 202.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=6, InterpolantAutomatonStates: 52, 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: 41.8ms SsaConstructionTime, 353.2ms SatisfiabilityAnalysisTime, 603.3ms InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...