/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 02:29:04,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 02:29:04,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 02:29:04,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 02:29:04,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 02:29:04,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 02:29:04,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 02:29:04,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 02:29:04,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 02:29:04,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 02:29:04,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 02:29:04,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 02:29:04,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 02:29:04,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 02:29:04,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 02:29:04,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 02:29:04,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 02:29:04,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 02:29:04,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 02:29:04,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 02:29:04,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 02:29:04,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 02:29:04,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 02:29:04,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 02:29:04,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 02:29:04,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 02:29:04,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 02:29:04,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 02:29:04,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 02:29:04,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 02:29:04,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 02:29:04,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 02:29:04,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 02:29:04,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 02:29:04,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 02:29:04,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 02:29:04,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 02:29:04,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 02:29:04,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 02:29:04,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 02:29:04,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 02:29:04,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-03-11 02:29:04,439 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 02:29:04,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 02:29:04,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 02:29:04,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 02:29:04,441 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 02:29:04,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 02:29:04,442 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 02:29:04,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 02:29:04,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 02:29:04,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 02:29:04,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 02:29:04,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:29:04,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 02:29:04,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 02:29:04,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-11 02:29:04,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 02:29:04,445 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-11 02:29:04,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 02:29:04,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 02:29:04,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 02:29:04,698 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 02:29:04,707 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 02:29:04,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_tso.oepc.i [2021-03-11 02:29:04,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10153f499/1dc4c7858e314eadb141f5e18ad07f21/FLAG06bd9cd75 [2021-03-11 02:29:05,206 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 02:29:05,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_tso.oepc.i [2021-03-11 02:29:05,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10153f499/1dc4c7858e314eadb141f5e18ad07f21/FLAG06bd9cd75 [2021-03-11 02:29:05,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10153f499/1dc4c7858e314eadb141f5e18ad07f21 [2021-03-11 02:29:05,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 02:29:05,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 02:29:05,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 02:29:05,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 02:29:05,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 02:29:05,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e068f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05, skipping insertion in model container [2021-03-11 02:29:05,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 02:29:05,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 02:29:05,439 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/rfi006_tso.oepc.i[949,962] [2021-03-11 02:29:05,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:29:05,587 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 02:29:05,597 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/rfi006_tso.oepc.i[949,962] [2021-03-11 02:29:05,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:29:05,715 INFO L208 MainTranslator]: Completed translation [2021-03-11 02:29:05,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05 WrapperNode [2021-03-11 02:29:05,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 02:29:05,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 02:29:05,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 02:29:05,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 02:29:05,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 02:29:05,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 02:29:05,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 02:29:05,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 02:29:05,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (1/1) ... [2021-03-11 02:29:05,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 02:29:05,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 02:29:05,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 02:29:05,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 02:29:05,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (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-11 02:29:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 02:29:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 02:29:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 02:29:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 02:29:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 02:29:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 02:29:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 02:29:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 02:29:05,843 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 02:29:07,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 02:29:07,408 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 02:29:07,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:29:07 BoogieIcfgContainer [2021-03-11 02:29:07,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 02:29:07,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 02:29:07,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 02:29:07,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 02:29:07,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:29:05" (1/3) ... [2021-03-11 02:29:07,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791e253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:29:07, skipping insertion in model container [2021-03-11 02:29:07,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:29:05" (2/3) ... [2021-03-11 02:29:07,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791e253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:29:07, skipping insertion in model container [2021-03-11 02:29:07,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:29:07" (3/3) ... [2021-03-11 02:29:07,414 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi006_tso.oepc.i [2021-03-11 02:29:07,418 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 02:29:07,421 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 02:29:07,421 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 02:29:07,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,452 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,452 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,457 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,458 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,478 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,479 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:29:07,485 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 02:29:07,516 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 02:29:07,528 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 02:29:07,528 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 02:29:07,528 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 02:29:07,529 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 02:29:07,529 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 02:29:07,529 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 02:29:07,529 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 02:29:07,529 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 02:29:07,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 02:29:07,559 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 02:29:07,559 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:29:07,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 02:29:07,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 02:29:07,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-11 02:29:07,575 INFO L129 PetriNetUnfolder]: 0/51 cut-off events. [2021-03-11 02:29:07,575 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:29:07,575 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:07,576 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:07,576 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2257093, now seen corresponding path program 1 times [2021-03-11 02:29:07,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:07,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248199876] [2021-03-11 02:29:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:07,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:07,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:07,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:07,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:07,790 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-11 02:29:07,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248199876] [2021-03-11 02:29:07,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:07,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 02:29:07,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230537280] [2021-03-11 02:29:07,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 02:29:07,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 02:29:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 02:29:07,807 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2021-03-11 02:29:07,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-11 02:29:07,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:07,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2021-03-11 02:29:07,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:07,932 INFO L129 PetriNetUnfolder]: 69/301 cut-off events. [2021-03-11 02:29:07,933 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:29:07,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 301 events. 69/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1386 event pairs, 9 based on Foata normal form. 19/301 useless extension candidates. Maximal degree in co-relation 383. Up to 97 conditions per place. [2021-03-11 02:29:07,937 INFO L132 encePairwiseOnDemand]: 93/98 looper letters, 10 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2021-03-11 02:29:07,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 95 transitions, 223 flow [2021-03-11 02:29:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 02:29:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 02:29:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2021-03-11 02:29:07,949 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2021-03-11 02:29:07,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2021-03-11 02:29:07,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2021-03-11 02:29:07,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:07,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2021-03-11 02:29:07,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-11 02:29:07,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-11 02:29:07,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-11 02:29:07,960 INFO L185 Difference]: Start difference. First operand has 103 places, 95 transitions, 199 flow. Second operand 3 states and 275 transitions. [2021-03-11 02:29:07,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 95 transitions, 223 flow [2021-03-11 02:29:07,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 02:29:07,964 INFO L241 Difference]: Finished difference. Result has 100 places, 91 transitions, 192 flow [2021-03-11 02:29:07,966 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2021-03-11 02:29:07,966 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2021-03-11 02:29:07,966 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 192 flow [2021-03-11 02:29:07,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-11 02:29:07,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:07,967 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:07,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 02:29:07,967 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:07,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2093998835, now seen corresponding path program 1 times [2021-03-11 02:29:07,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:07,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104602347] [2021-03-11 02:29:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:08,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:08,104 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:29:08,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:29:08,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,129 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-11 02:29:08,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104602347] [2021-03-11 02:29:08,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:08,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:29:08,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188867256] [2021-03-11 02:29:08,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:29:08,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:29:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:29:08,132 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2021-03-11 02:29:08,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-11 02:29:08,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:08,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2021-03-11 02:29:08,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:08,229 INFO L129 PetriNetUnfolder]: 4/138 cut-off events. [2021-03-11 02:29:08,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:29:08,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 138 events. 4/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 257 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2021-03-11 02:29:08,230 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 6 selfloop transitions, 2 changer transitions 23/103 dead transitions. [2021-03-11 02:29:08,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 103 transitions, 258 flow [2021-03-11 02:29:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:29:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:29:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 797 transitions. [2021-03-11 02:29:08,235 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9036281179138322 [2021-03-11 02:29:08,235 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 797 transitions. [2021-03-11 02:29:08,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 797 transitions. [2021-03-11 02:29:08,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:08,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 797 transitions. [2021-03-11 02:29:08,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.55555555555556) internal successors, (797), 9 states have internal predecessors, (797), 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-11 02:29:08,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:08,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:08,240 INFO L185 Difference]: Start difference. First operand has 100 places, 91 transitions, 192 flow. Second operand 9 states and 797 transitions. [2021-03-11 02:29:08,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 103 transitions, 258 flow [2021-03-11 02:29:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 103 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 02:29:08,243 INFO L241 Difference]: Finished difference. Result has 113 places, 80 transitions, 186 flow [2021-03-11 02:29:08,243 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=113, PETRI_TRANSITIONS=80} [2021-03-11 02:29:08,243 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 10 predicate places. [2021-03-11 02:29:08,243 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 80 transitions, 186 flow [2021-03-11 02:29:08,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-11 02:29:08,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:08,244 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:08,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 02:29:08,244 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:08,250 INFO L82 PathProgramCache]: Analyzing trace with hash 765192471, now seen corresponding path program 1 times [2021-03-11 02:29:08,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:08,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126590872] [2021-03-11 02:29:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:08,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:08,403 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:29:08,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:29:08,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,441 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-11 02:29:08,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126590872] [2021-03-11 02:29:08,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:08,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:29:08,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033967797] [2021-03-11 02:29:08,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:29:08,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:29:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:29:08,443 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2021-03-11 02:29:08,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 80 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-11 02:29:08,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:08,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2021-03-11 02:29:08,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:08,541 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2021-03-11 02:29:08,541 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-11 02:29:08,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 106 events. 3/106 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 145. Up to 7 conditions per place. [2021-03-11 02:29:08,542 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 6 selfloop transitions, 2 changer transitions 10/90 dead transitions. [2021-03-11 02:29:08,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 90 transitions, 260 flow [2021-03-11 02:29:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:29:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:29:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 794 transitions. [2021-03-11 02:29:08,543 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9002267573696145 [2021-03-11 02:29:08,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 794 transitions. [2021-03-11 02:29:08,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 794 transitions. [2021-03-11 02:29:08,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:08,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 794 transitions. [2021-03-11 02:29:08,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.22222222222223) internal successors, (794), 9 states have internal predecessors, (794), 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-11 02:29:08,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:08,546 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:08,547 INFO L185 Difference]: Start difference. First operand has 113 places, 80 transitions, 186 flow. Second operand 9 states and 794 transitions. [2021-03-11 02:29:08,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 90 transitions, 260 flow [2021-03-11 02:29:08,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 228 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-11 02:29:08,548 INFO L241 Difference]: Finished difference. Result has 103 places, 80 transitions, 190 flow [2021-03-11 02:29:08,549 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2021-03-11 02:29:08,549 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 0 predicate places. [2021-03-11 02:29:08,549 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 190 flow [2021-03-11 02:29:08,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 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-11 02:29:08,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:08,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:08,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 02:29:08,550 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:08,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:08,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1403177640, now seen corresponding path program 1 times [2021-03-11 02:29:08,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:08,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226713196] [2021-03-11 02:29:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:08,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:08,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:08,616 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:29:08,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:29:08,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,641 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-11 02:29:08,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226713196] [2021-03-11 02:29:08,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:08,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:29:08,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571949148] [2021-03-11 02:29:08,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:29:08,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:29:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:29:08,643 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 98 [2021-03-11 02:29:08,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 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-11 02:29:08,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:08,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 98 [2021-03-11 02:29:08,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:08,787 INFO L129 PetriNetUnfolder]: 25/160 cut-off events. [2021-03-11 02:29:08,787 INFO L130 PetriNetUnfolder]: For 45/65 co-relation queries the response was YES. [2021-03-11 02:29:08,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 160 events. 25/160 cut-off events. For 45/65 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 430 event pairs, 1 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 267. Up to 19 conditions per place. [2021-03-11 02:29:08,788 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 9 selfloop transitions, 4 changer transitions 18/100 dead transitions. [2021-03-11 02:29:08,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 319 flow [2021-03-11 02:29:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 02:29:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 02:29:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 863 transitions. [2021-03-11 02:29:08,791 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8806122448979592 [2021-03-11 02:29:08,791 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 863 transitions. [2021-03-11 02:29:08,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 863 transitions. [2021-03-11 02:29:08,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:08,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 863 transitions. [2021-03-11 02:29:08,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.3) internal successors, (863), 10 states have internal predecessors, (863), 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-11 02:29:08,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-11 02:29:08,795 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-11 02:29:08,795 INFO L185 Difference]: Start difference. First operand has 103 places, 80 transitions, 190 flow. Second operand 10 states and 863 transitions. [2021-03-11 02:29:08,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 319 flow [2021-03-11 02:29:08,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 285 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-11 02:29:08,800 INFO L241 Difference]: Finished difference. Result has 106 places, 80 transitions, 204 flow [2021-03-11 02:29:08,800 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=204, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2021-03-11 02:29:08,800 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2021-03-11 02:29:08,801 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 204 flow [2021-03-11 02:29:08,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 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-11 02:29:08,801 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:08,801 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:08,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 02:29:08,802 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1722678177, now seen corresponding path program 1 times [2021-03-11 02:29:08,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:08,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329250798] [2021-03-11 02:29:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:08,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:08,900 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:29:08,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:29:08,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:29:08,918 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:29:08,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:08,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:08,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:08,927 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-11 02:29:08,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329250798] [2021-03-11 02:29:08,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:08,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:29:08,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815307213] [2021-03-11 02:29:08,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:29:08,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:29:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:29:08,929 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2021-03-11 02:29:08,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 80 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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-11 02:29:08,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:08,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2021-03-11 02:29:08,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:09,032 INFO L129 PetriNetUnfolder]: 91/315 cut-off events. [2021-03-11 02:29:09,032 INFO L130 PetriNetUnfolder]: For 68/69 co-relation queries the response was YES. [2021-03-11 02:29:09,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 315 events. 91/315 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1523 event pairs, 2 based on Foata normal form. 8/319 useless extension candidates. Maximal degree in co-relation 539. Up to 81 conditions per place. [2021-03-11 02:29:09,034 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 10 selfloop transitions, 6 changer transitions 19/105 dead transitions. [2021-03-11 02:29:09,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 324 flow [2021-03-11 02:29:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:29:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:29:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 793 transitions. [2021-03-11 02:29:09,036 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8990929705215419 [2021-03-11 02:29:09,036 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 793 transitions. [2021-03-11 02:29:09,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 793 transitions. [2021-03-11 02:29:09,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:09,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 793 transitions. [2021-03-11 02:29:09,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 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-11 02:29:09,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:09,039 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:09,039 INFO L185 Difference]: Start difference. First operand has 106 places, 80 transitions, 204 flow. Second operand 9 states and 793 transitions. [2021-03-11 02:29:09,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 324 flow [2021-03-11 02:29:09,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 298 flow, removed 8 selfloop flow, removed 10 redundant places. [2021-03-11 02:29:09,041 INFO L241 Difference]: Finished difference. Result has 104 places, 83 transitions, 234 flow [2021-03-11 02:29:09,041 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2021-03-11 02:29:09,042 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2021-03-11 02:29:09,042 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 234 flow [2021-03-11 02:29:09,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 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-11 02:29:09,042 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:09,042 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:09,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 02:29:09,042 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:09,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash 91402468, now seen corresponding path program 1 times [2021-03-11 02:29:09,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:09,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624207909] [2021-03-11 02:29:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:09,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,152 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:29:09,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:29:09,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:29:09,186 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:29:09,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,195 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-11 02:29:09,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624207909] [2021-03-11 02:29:09,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:09,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:29:09,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349869090] [2021-03-11 02:29:09,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:29:09,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:29:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:29:09,197 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2021-03-11 02:29:09,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 02:29:09,198 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:09,198 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2021-03-11 02:29:09,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:09,307 INFO L129 PetriNetUnfolder]: 52/216 cut-off events. [2021-03-11 02:29:09,308 INFO L130 PetriNetUnfolder]: For 287/295 co-relation queries the response was YES. [2021-03-11 02:29:09,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 216 events. 52/216 cut-off events. For 287/295 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 783 event pairs, 0 based on Foata normal form. 11/226 useless extension candidates. Maximal degree in co-relation 552. Up to 75 conditions per place. [2021-03-11 02:29:09,309 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 10 selfloop transitions, 9 changer transitions 19/108 dead transitions. [2021-03-11 02:29:09,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 487 flow [2021-03-11 02:29:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 02:29:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 02:29:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 880 transitions. [2021-03-11 02:29:09,311 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8979591836734694 [2021-03-11 02:29:09,311 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 880 transitions. [2021-03-11 02:29:09,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 880 transitions. [2021-03-11 02:29:09,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:09,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 880 transitions. [2021-03-11 02:29:09,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 88.0) internal successors, (880), 10 states have internal predecessors, (880), 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-11 02:29:09,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-11 02:29:09,314 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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-11 02:29:09,314 INFO L185 Difference]: Start difference. First operand has 104 places, 83 transitions, 234 flow. Second operand 10 states and 880 transitions. [2021-03-11 02:29:09,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 487 flow [2021-03-11 02:29:09,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 463 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-03-11 02:29:09,318 INFO L241 Difference]: Finished difference. Result has 110 places, 86 transitions, 302 flow [2021-03-11 02:29:09,318 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2021-03-11 02:29:09,318 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 7 predicate places. [2021-03-11 02:29:09,318 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 302 flow [2021-03-11 02:29:09,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-11 02:29:09,318 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:09,319 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:09,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 02:29:09,319 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 324984768, now seen corresponding path program 1 times [2021-03-11 02:29:09,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:09,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103768085] [2021-03-11 02:29:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:09,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,399 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:29:09,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:29:09,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,426 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-11 02:29:09,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103768085] [2021-03-11 02:29:09,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:09,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:29:09,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563411481] [2021-03-11 02:29:09,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:29:09,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:09,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:29:09,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:29:09,429 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 98 [2021-03-11 02:29:09,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 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-11 02:29:09,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:09,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 98 [2021-03-11 02:29:09,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:09,521 INFO L129 PetriNetUnfolder]: 34/279 cut-off events. [2021-03-11 02:29:09,521 INFO L130 PetriNetUnfolder]: For 568/580 co-relation queries the response was YES. [2021-03-11 02:29:09,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 279 events. 34/279 cut-off events. For 568/580 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1228 event pairs, 6 based on Foata normal form. 9/285 useless extension candidates. Maximal degree in co-relation 687. Up to 60 conditions per place. [2021-03-11 02:29:09,522 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 15 selfloop transitions, 2 changer transitions 4/96 dead transitions. [2021-03-11 02:29:09,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 370 flow [2021-03-11 02:29:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:29:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:29:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2021-03-11 02:29:09,524 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8790087463556852 [2021-03-11 02:29:09,524 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 603 transitions. [2021-03-11 02:29:09,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 603 transitions. [2021-03-11 02:29:09,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:09,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 603 transitions. [2021-03-11 02:29:09,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 86.14285714285714) internal successors, (603), 7 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:09,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-11 02:29:09,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-11 02:29:09,527 INFO L185 Difference]: Start difference. First operand has 110 places, 86 transitions, 302 flow. Second operand 7 states and 603 transitions. [2021-03-11 02:29:09,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 370 flow [2021-03-11 02:29:09,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 96 transitions, 314 flow, removed 20 selfloop flow, removed 9 redundant places. [2021-03-11 02:29:09,530 INFO L241 Difference]: Finished difference. Result has 108 places, 87 transitions, 265 flow [2021-03-11 02:29:09,530 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=108, PETRI_TRANSITIONS=87} [2021-03-11 02:29:09,530 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2021-03-11 02:29:09,531 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 87 transitions, 265 flow [2021-03-11 02:29:09,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 84.57142857142857) internal successors, (592), 7 states have internal predecessors, (592), 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-11 02:29:09,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:09,531 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:09,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 02:29:09,531 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1205444122, now seen corresponding path program 2 times [2021-03-11 02:29:09,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:09,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433081308] [2021-03-11 02:29:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:09,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,622 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:29:09,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:29:09,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:29:09,641 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:29:09,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,650 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-11 02:29:09,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433081308] [2021-03-11 02:29:09,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:09,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 02:29:09,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763152833] [2021-03-11 02:29:09,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 02:29:09,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:09,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 02:29:09,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 02:29:09,652 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2021-03-11 02:29:09,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 87 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-11 02:29:09,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:09,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2021-03-11 02:29:09,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:09,783 INFO L129 PetriNetUnfolder]: 32/206 cut-off events. [2021-03-11 02:29:09,783 INFO L130 PetriNetUnfolder]: For 275/303 co-relation queries the response was YES. [2021-03-11 02:29:09,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 206 events. 32/206 cut-off events. For 275/303 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 726 event pairs, 0 based on Foata normal form. 24/227 useless extension candidates. Maximal degree in co-relation 505. Up to 53 conditions per place. [2021-03-11 02:29:09,784 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 4 selfloop transitions, 12 changer transitions 14/100 dead transitions. [2021-03-11 02:29:09,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 410 flow [2021-03-11 02:29:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 02:29:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 02:29:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 955 transitions. [2021-03-11 02:29:09,785 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.885899814471243 [2021-03-11 02:29:09,786 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 955 transitions. [2021-03-11 02:29:09,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 955 transitions. [2021-03-11 02:29:09,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:09,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 955 transitions. [2021-03-11 02:29:09,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 86.81818181818181) internal successors, (955), 11 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:09,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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-11 02:29:09,789 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 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-11 02:29:09,789 INFO L185 Difference]: Start difference. First operand has 108 places, 87 transitions, 265 flow. Second operand 11 states and 955 transitions. [2021-03-11 02:29:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 410 flow [2021-03-11 02:29:09,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 100 transitions, 377 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-03-11 02:29:09,791 INFO L241 Difference]: Finished difference. Result has 115 places, 86 transitions, 284 flow [2021-03-11 02:29:09,791 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=284, PETRI_PLACES=115, PETRI_TRANSITIONS=86} [2021-03-11 02:29:09,791 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 12 predicate places. [2021-03-11 02:29:09,791 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 86 transitions, 284 flow [2021-03-11 02:29:09,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 85.125) internal successors, (681), 8 states have internal predecessors, (681), 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-11 02:29:09,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:09,792 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:09,792 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 02:29:09,792 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:09,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash -371708945, now seen corresponding path program 1 times [2021-03-11 02:29:09,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:09,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436685680] [2021-03-11 02:29:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:29:09,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:29:09,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:29:09,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 02:29:09,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 02:29:09,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 02:29:09,920 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-03-11 02:29:09,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-11 02:29:09,926 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:29:09,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:29:09,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:29:09,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:29:09,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:29:09,954 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-11 02:29:09,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436685680] [2021-03-11 02:29:09,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:29:09,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-11 02:29:09,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093350747] [2021-03-11 02:29:09,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 02:29:09,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:29:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 02:29:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-11 02:29:09,956 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 98 [2021-03-11 02:29:09,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 86 transitions, 284 flow. Second operand has 10 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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-11 02:29:09,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:29:09,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 98 [2021-03-11 02:29:09,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:29:10,107 INFO L129 PetriNetUnfolder]: 47/274 cut-off events. [2021-03-11 02:29:10,107 INFO L130 PetriNetUnfolder]: For 177/184 co-relation queries the response was YES. [2021-03-11 02:29:10,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 274 events. 47/274 cut-off events. For 177/184 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1203 event pairs, 5 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 554. Up to 55 conditions per place. [2021-03-11 02:29:10,109 INFO L132 encePairwiseOnDemand]: 87/98 looper letters, 15 selfloop transitions, 6 changer transitions 9/98 dead transitions. [2021-03-11 02:29:10,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 98 transitions, 370 flow [2021-03-11 02:29:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:29:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:29:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 715 transitions. [2021-03-11 02:29:10,110 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8106575963718821 [2021-03-11 02:29:10,110 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 715 transitions. [2021-03-11 02:29:10,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 715 transitions. [2021-03-11 02:29:10,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:29:10,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 715 transitions. [2021-03-11 02:29:10,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 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-11 02:29:10,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:10,114 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:29:10,114 INFO L185 Difference]: Start difference. First operand has 115 places, 86 transitions, 284 flow. Second operand 9 states and 715 transitions. [2021-03-11 02:29:10,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 98 transitions, 370 flow [2021-03-11 02:29:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 290 flow, removed 21 selfloop flow, removed 16 redundant places. [2021-03-11 02:29:10,116 INFO L241 Difference]: Finished difference. Result has 106 places, 88 transitions, 239 flow [2021-03-11 02:29:10,116 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2021-03-11 02:29:10,116 INFO L335 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2021-03-11 02:29:10,116 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 239 flow [2021-03-11 02:29:10,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 77.8) internal successors, (778), 10 states have internal predecessors, (778), 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-11 02:29:10,117 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:29:10,117 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:29:10,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 02:29:10,117 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:29:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:29:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1279285463, now seen corresponding path program 2 times [2021-03-11 02:29:10,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:29:10,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870914136] [2021-03-11 02:29:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:29:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:29:10,161 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:29:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:29:10,202 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:29:10,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 02:29:10,237 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 02:29:10,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 02:29:10,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:29:10 BasicIcfg [2021-03-11 02:29:10,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 02:29:10,344 INFO L168 Benchmark]: Toolchain (without parser) took 5103.80 ms. Allocated memory was 325.1 MB in the beginning and 404.8 MB in the end (delta: 79.7 MB). Free memory was 287.9 MB in the beginning and 358.4 MB in the end (delta: -70.5 MB). Peak memory consumption was 222.9 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,344 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 325.1 MB. Free memory is still 306.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 02:29:10,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 471.84 ms. Allocated memory is still 325.1 MB. Free memory was 287.3 MB in the beginning and 282.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 325.1 MB. Free memory was 282.4 MB in the beginning and 279.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,345 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 325.1 MB. Free memory was 279.2 MB in the beginning and 276.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,345 INFO L168 Benchmark]: RCFGBuilder took 1619.22 ms. Allocated memory is still 325.1 MB. Free memory was 276.1 MB in the beginning and 137.6 MB in the end (delta: 138.4 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,345 INFO L168 Benchmark]: TraceAbstraction took 2932.96 ms. Allocated memory was 325.1 MB in the beginning and 404.8 MB in the end (delta: 79.7 MB). Free memory was 137.6 MB in the beginning and 358.4 MB in the end (delta: -220.8 MB). Peak memory consumption was 70.7 MB. Max. memory is 16.0 GB. [2021-03-11 02:29:10,347 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.09 ms. Allocated memory is still 325.1 MB. Free memory is still 306.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 471.84 ms. Allocated memory is still 325.1 MB. Free memory was 287.3 MB in the beginning and 282.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 325.1 MB. Free memory was 282.4 MB in the beginning and 279.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.93 ms. Allocated memory is still 325.1 MB. Free memory was 279.2 MB in the beginning and 276.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1619.22 ms. Allocated memory is still 325.1 MB. Free memory was 276.1 MB in the beginning and 137.6 MB in the end (delta: 138.4 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2932.96 ms. Allocated memory was 325.1 MB in the beginning and 404.8 MB in the end (delta: 79.7 MB). Free memory was 137.6 MB in the beginning and 358.4 MB in the end (delta: -220.8 MB). Peak memory consumption was 70.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__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; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L833] 0 pthread_t t1699; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L834] FCALL, FORK 0 pthread_create(&t1699, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L835] 0 pthread_t t1700; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L836] FCALL, FORK 0 pthread_create(&t1700, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L837] 0 pthread_t t1701; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L838] FCALL, FORK 0 pthread_create(&t1701, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 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) [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L779] 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) [L779] 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) [L780] 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)) [L780] 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)) [L781] 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)) [L781] 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)) [L782] 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)) [L782] 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)) [L783] 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)) [L783] 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)) [L784] 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)) [L784] 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)) [L785] 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)) [L785] 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)) [L786] 2 __unbuffered_p1_EAX = y [L787] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L811] 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) [L811] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L811] 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) [L811] 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) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 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 [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L815] 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 [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 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) [L844] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L844] 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) [L844] 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) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 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 [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L848] 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 [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2711.9ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1179.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 71 SDtfs, 185 SDslu, 222 SDs, 0 SdLazy, 391 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 261.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 681.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=6, InterpolantAutomatonStates: 77, 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: 57.3ms SsaConstructionTime, 484.2ms SatisfiabilityAnalysisTime, 729.6ms InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 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...