/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 01:08:43,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 01:08:43,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 01:08:43,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 01:08:43,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 01:08:43,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 01:08:43,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 01:08:43,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 01:08:43,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 01:08:43,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 01:08:43,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 01:08:43,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 01:08:43,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 01:08:43,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 01:08:43,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 01:08:43,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 01:08:43,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 01:08:43,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 01:08:43,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 01:08:43,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 01:08:43,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 01:08:43,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 01:08:43,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 01:08:43,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 01:08:43,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 01:08:43,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 01:08:43,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 01:08:43,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 01:08:43,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 01:08:43,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 01:08:43,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 01:08:43,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 01:08:43,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 01:08:43,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 01:08:43,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 01:08:43,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 01:08:43,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 01:08:43,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 01:08:43,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 01:08:43,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 01:08:43,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 01:08:43,562 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-OGIterative.epf [2021-08-13 01:08:43,596 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 01:08:43,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 01:08:43,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 01:08:43,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 01:08:43,601 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 01:08:43,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 01:08:43,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 01:08:43,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 01:08:43,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 01:08:43,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 01:08:43,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 01:08:43,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 01:08:43,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 01:08:43,603 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 01:08:43,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 01:08:43,604 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 01:08:43,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 01:08:43,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 01:08:43,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 01:08:43,625 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 01:08:43,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 01:08:43,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 01:08:43,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 01:08:43,626 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 01:08:43,627 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-08-13 01:08:43,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 01:08:43,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 01:08:43,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 01:08:43,941 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 01:08:43,942 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 01:08:43,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2021-08-13 01:08:43,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789692d5c/dab982a67ad44552b2a3b2eb58d86c02/FLAG304f0207b [2021-08-13 01:08:44,552 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 01:08:44,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i [2021-08-13 01:08:44,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789692d5c/dab982a67ad44552b2a3b2eb58d86c02/FLAG304f0207b [2021-08-13 01:08:44,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789692d5c/dab982a67ad44552b2a3b2eb58d86c02 [2021-08-13 01:08:45,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 01:08:45,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 01:08:45,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 01:08:45,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 01:08:45,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 01:08:45,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:08:44" (1/1) ... [2021-08-13 01:08:45,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1ed64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45, skipping insertion in model container [2021-08-13 01:08:45,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 01:08:44" (1/1) ... [2021-08-13 01:08:45,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 01:08:45,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 01:08:45,204 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i[949,962] [2021-08-13 01:08:45,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:08:45,337 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 01:08:45,346 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.opt.i[949,962] [2021-08-13 01:08:45,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 01:08:45,476 INFO L208 MainTranslator]: Completed translation [2021-08-13 01:08:45,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45 WrapperNode [2021-08-13 01:08:45,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 01:08:45,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 01:08:45,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 01:08:45,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 01:08:45,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 01:08:45,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 01:08:45,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 01:08:45,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 01:08:45,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... [2021-08-13 01:08:45,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 01:08:45,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 01:08:45,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 01:08:45,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 01:08:45,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 01:08:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 01:08:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 01:08:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 01:08:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 01:08:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 01:08:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 01:08:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 01:08:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 01:08:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 01:08:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 01:08:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 01:08:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 01:08:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 01:08:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 01:08:45,697 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 01:08:47,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 01:08:47,656 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 01:08:47,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:08:47 BoogieIcfgContainer [2021-08-13 01:08:47,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 01:08:47,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 01:08:47,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 01:08:47,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 01:08:47,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 01:08:44" (1/3) ... [2021-08-13 01:08:47,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b55bb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:08:47, skipping insertion in model container [2021-08-13 01:08:47,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 01:08:45" (2/3) ... [2021-08-13 01:08:47,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b55bb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 01:08:47, skipping insertion in model container [2021-08-13 01:08:47,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 01:08:47" (3/3) ... [2021-08-13 01:08:47,666 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_pso.opt.i [2021-08-13 01:08:47,672 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 01:08:47,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 01:08:47,673 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 01:08:47,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,706 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,713 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,727 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,731 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 01:08:47,743 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 01:08:47,765 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 01:08:47,782 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 01:08:47,782 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 01:08:47,782 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 01:08:47,782 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 01:08:47,783 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 01:08:47,783 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 01:08:47,783 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 01:08:47,783 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 01:08:47,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-08-13 01:08:47,841 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-08-13 01:08:47,841 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:08:47,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-08-13 01:08:47,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2021-08-13 01:08:47,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2021-08-13 01:08:47,874 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-08-13 01:08:47,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:08:47,874 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:47,875 INFO L266 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] [2021-08-13 01:08:47,875 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -205127991, now seen corresponding path program 1 times [2021-08-13 01:08:47,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:47,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22497390] [2021-08-13 01:08:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:48,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:48,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:48,170 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:48,170 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22497390] [2021-08-13 01:08:48,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22497390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:48,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:48,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 01:08:48,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115298764] [2021-08-13 01:08:48,179 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 01:08:48,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 01:08:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 01:08:48,194 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2021-08-13 01:08:48,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-08-13 01:08:48,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:48,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2021-08-13 01:08:48,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:48,365 INFO L129 PetriNetUnfolder]: 49/389 cut-off events. [2021-08-13 01:08:48,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 01:08:48,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 389 events. 49/389 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1931 event pairs, 27 based on Foata normal form. 18/383 useless extension candidates. Maximal degree in co-relation 437. Up to 65 conditions per place. [2021-08-13 01:08:48,372 INFO L132 encePairwiseOnDemand]: 102/107 looper letters, 9 selfloop transitions, 2 changer transitions 0/104 dead transitions. [2021-08-13 01:08:48,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 239 flow [2021-08-13 01:08:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 01:08:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 01:08:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2021-08-13 01:08:48,388 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9470404984423676 [2021-08-13 01:08:48,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2021-08-13 01:08:48,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2021-08-13 01:08:48,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:48,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2021-08-13 01:08:48,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-08-13 01:08:48,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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-08-13 01:08:48,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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-08-13 01:08:48,405 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 0 predicate places. [2021-08-13 01:08:48,405 INFO L482 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 239 flow [2021-08-13 01:08:48,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-08-13 01:08:48,406 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:48,406 INFO L266 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-08-13 01:08:48,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 01:08:48,406 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1262180099, now seen corresponding path program 1 times [2021-08-13 01:08:48,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:48,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701257225] [2021-08-13 01:08:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:48,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:48,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:48,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:48,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:48,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:08:48,719 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-08-13 01:08:48,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 01:08:48,747 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:48,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:48,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:48,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:48,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:48,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:48,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:48,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701257225] [2021-08-13 01:08:48,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701257225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:48,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:48,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 01:08:48,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467155757] [2021-08-13 01:08:48,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 01:08:48,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 01:08:48,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-13 01:08:48,807 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2021-08-13 01:08:48,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 239 flow. Second operand has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 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-08-13 01:08:48,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:48,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2021-08-13 01:08:48,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:49,379 INFO L129 PetriNetUnfolder]: 360/1085 cut-off events. [2021-08-13 01:08:49,379 INFO L130 PetriNetUnfolder]: For 259/445 co-relation queries the response was YES. [2021-08-13 01:08:49,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1085 events. 360/1085 cut-off events. For 259/445 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7512 event pairs, 95 based on Foata normal form. 4/1058 useless extension candidates. Maximal degree in co-relation 1993. Up to 340 conditions per place. [2021-08-13 01:08:49,386 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 18 selfloop transitions, 10 changer transitions 63/165 dead transitions. [2021-08-13 01:08:49,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 165 transitions, 601 flow [2021-08-13 01:08:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 01:08:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 01:08:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1365 transitions. [2021-08-13 01:08:49,390 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8504672897196262 [2021-08-13 01:08:49,390 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1365 transitions. [2021-08-13 01:08:49,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1365 transitions. [2021-08-13 01:08:49,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:49,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1365 transitions. [2021-08-13 01:08:49,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 91.0) internal successors, (1365), 15 states have internal predecessors, (1365), 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-08-13 01:08:49,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 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-08-13 01:08:49,401 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 107.0) internal successors, (1712), 16 states have internal predecessors, (1712), 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-08-13 01:08:49,402 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 14 predicate places. [2021-08-13 01:08:49,402 INFO L482 AbstractCegarLoop]: Abstraction has has 126 places, 165 transitions, 601 flow [2021-08-13 01:08:49,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 87.1) internal successors, (871), 10 states have internal predecessors, (871), 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-08-13 01:08:49,403 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:49,403 INFO L266 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-08-13 01:08:49,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 01:08:49,403 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1218734298, now seen corresponding path program 1 times [2021-08-13 01:08:49,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:49,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960529355] [2021-08-13 01:08:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:49,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:49,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:49,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:49,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:49,528 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:49,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:49,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:49,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:49,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:49,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:49,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:49,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:49,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:49,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960529355] [2021-08-13 01:08:49,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960529355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:49,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:49,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:08:49,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312691893] [2021-08-13 01:08:49,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:08:49,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:08:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:08:49,571 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2021-08-13 01:08:49,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 165 transitions, 601 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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-08-13 01:08:49,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:49,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2021-08-13 01:08:49,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:50,008 INFO L129 PetriNetUnfolder]: 751/2267 cut-off events. [2021-08-13 01:08:50,009 INFO L130 PetriNetUnfolder]: For 603/773 co-relation queries the response was YES. [2021-08-13 01:08:50,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 2267 events. 751/2267 cut-off events. For 603/773 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19209 event pairs, 179 based on Foata normal form. 0/2235 useless extension candidates. Maximal degree in co-relation 4490. Up to 578 conditions per place. [2021-08-13 01:08:50,023 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 7 selfloop transitions, 2 changer transitions 102/204 dead transitions. [2021-08-13 01:08:50,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 204 transitions, 885 flow [2021-08-13 01:08:50,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:08:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:08:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2021-08-13 01:08:50,026 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9117341640706127 [2021-08-13 01:08:50,027 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2021-08-13 01:08:50,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2021-08-13 01:08:50,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:50,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2021-08-13 01:08:50,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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-08-13 01:08:50,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-08-13 01:08:50,035 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-08-13 01:08:50,035 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 22 predicate places. [2021-08-13 01:08:50,035 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 204 transitions, 885 flow [2021-08-13 01:08:50,036 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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-08-13 01:08:50,036 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:50,039 INFO L266 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] [2021-08-13 01:08:50,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 01:08:50,039 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1403640123, now seen corresponding path program 1 times [2021-08-13 01:08:50,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:50,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134090724] [2021-08-13 01:08:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:50,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:50,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:50,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:50,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:50,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:08:50,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:08:50,317 INFO L142 QuantifierPusher]: treesize reduction 37, result has 50.0 percent of original size [2021-08-13 01:08:50,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-08-13 01:08:50,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:50,367 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:50,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:50,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:50,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:50,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:50,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:50,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:50,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134090724] [2021-08-13 01:08:50,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134090724] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:50,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:50,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 01:08:50,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519254601] [2021-08-13 01:08:50,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 01:08:50,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:50,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 01:08:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-13 01:08:50,413 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2021-08-13 01:08:50,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 204 transitions, 885 flow. Second operand has 12 states, 12 states have (on average 86.08333333333333) internal successors, (1033), 12 states have internal predecessors, (1033), 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-08-13 01:08:50,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:50,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2021-08-13 01:08:50,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:51,248 INFO L129 PetriNetUnfolder]: 1057/3288 cut-off events. [2021-08-13 01:08:51,248 INFO L130 PetriNetUnfolder]: For 1052/1707 co-relation queries the response was YES. [2021-08-13 01:08:51,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8136 conditions, 3288 events. 1057/3288 cut-off events. For 1052/1707 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31064 event pairs, 201 based on Foata normal form. 49/3307 useless extension candidates. Maximal degree in co-relation 8072. Up to 917 conditions per place. [2021-08-13 01:08:51,268 INFO L132 encePairwiseOnDemand]: 93/107 looper letters, 22 selfloop transitions, 17 changer transitions 217/329 dead transitions. [2021-08-13 01:08:51,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 329 transitions, 2083 flow [2021-08-13 01:08:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 01:08:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 01:08:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1436 transitions. [2021-08-13 01:08:51,272 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8387850467289719 [2021-08-13 01:08:51,272 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1436 transitions. [2021-08-13 01:08:51,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1436 transitions. [2021-08-13 01:08:51,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:51,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1436 transitions. [2021-08-13 01:08:51,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 89.75) internal successors, (1436), 16 states have internal predecessors, (1436), 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-08-13 01:08:51,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-13 01:08:51,281 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-13 01:08:51,281 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 37 predicate places. [2021-08-13 01:08:51,281 INFO L482 AbstractCegarLoop]: Abstraction has has 149 places, 329 transitions, 2083 flow [2021-08-13 01:08:51,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 86.08333333333333) internal successors, (1033), 12 states have internal predecessors, (1033), 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-08-13 01:08:51,281 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:51,281 INFO L266 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] [2021-08-13 01:08:51,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 01:08:51,282 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -743460963, now seen corresponding path program 1 times [2021-08-13 01:08:51,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:51,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715686076] [2021-08-13 01:08:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:51,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:51,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:51,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:51,406 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:51,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:51,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:51,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:51,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:51,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:51,444 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:51,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715686076] [2021-08-13 01:08:51,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715686076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:51,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:51,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 01:08:51,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088694280] [2021-08-13 01:08:51,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 01:08:51,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 01:08:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 01:08:51,446 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-08-13 01:08:51,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 329 transitions, 2083 flow. Second operand has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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-08-13 01:08:51,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:51,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-08-13 01:08:51,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:52,463 INFO L129 PetriNetUnfolder]: 1884/5746 cut-off events. [2021-08-13 01:08:52,463 INFO L130 PetriNetUnfolder]: For 2622/3351 co-relation queries the response was YES. [2021-08-13 01:08:52,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 5746 events. 1884/5746 cut-off events. For 2622/3351 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 60173 event pairs, 320 based on Foata normal form. 30/5718 useless extension candidates. Maximal degree in co-relation 15015. Up to 1710 conditions per place. [2021-08-13 01:08:52,496 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 7 selfloop transitions, 4 changer transitions 351/454 dead transitions. [2021-08-13 01:08:52,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 454 transitions, 3561 flow [2021-08-13 01:08:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 01:08:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 01:08:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1246 transitions. [2021-08-13 01:08:52,500 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8957584471603163 [2021-08-13 01:08:52,500 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1246 transitions. [2021-08-13 01:08:52,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1246 transitions. [2021-08-13 01:08:52,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:52,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1246 transitions. [2021-08-13 01:08:52,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.84615384615384) internal successors, (1246), 13 states have internal predecessors, (1246), 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-08-13 01:08:52,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-13 01:08:52,507 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-13 01:08:52,507 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 49 predicate places. [2021-08-13 01:08:52,508 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 454 transitions, 3561 flow [2021-08-13 01:08:52,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 94.28571428571429) internal successors, (660), 7 states have internal predecessors, (660), 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-08-13 01:08:52,508 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:52,508 INFO L266 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-08-13 01:08:52,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 01:08:52,508 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1453400139, now seen corresponding path program 1 times [2021-08-13 01:08:52,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:52,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796111132] [2021-08-13 01:08:52,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:52,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:52,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:52,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:52,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:52,611 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:08:52,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:08:52,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:52,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:52,638 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:08:52,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:52,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:52,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:52,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-08-13 01:08:52,650 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:52,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796111132] [2021-08-13 01:08:52,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796111132] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:52,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:52,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 01:08:52,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458579667] [2021-08-13 01:08:52,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 01:08:52,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 01:08:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 01:08:52,653 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-08-13 01:08:52,654 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 454 transitions, 3561 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-08-13 01:08:52,654 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:52,654 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-08-13 01:08:52,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:53,289 INFO L129 PetriNetUnfolder]: 1086/3383 cut-off events. [2021-08-13 01:08:53,289 INFO L130 PetriNetUnfolder]: For 846/1055 co-relation queries the response was YES. [2021-08-13 01:08:53,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8323 conditions, 3383 events. 1086/3383 cut-off events. For 846/1055 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 31601 event pairs, 234 based on Foata normal form. 8/3199 useless extension candidates. Maximal degree in co-relation 8252. Up to 1126 conditions per place. [2021-08-13 01:08:53,322 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 24 selfloop transitions, 17 changer transitions 56/239 dead transitions. [2021-08-13 01:08:53,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 239 transitions, 1427 flow [2021-08-13 01:08:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 01:08:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 01:08:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2021-08-13 01:08:53,325 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9093457943925234 [2021-08-13 01:08:53,325 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 973 transitions. [2021-08-13 01:08:53,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions. [2021-08-13 01:08:53,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:53,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions. [2021-08-13 01:08:53,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 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-08-13 01:08:53,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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-08-13 01:08:53,330 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 107.0) internal successors, (1177), 11 states have internal predecessors, (1177), 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-08-13 01:08:53,330 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 49 predicate places. [2021-08-13 01:08:53,330 INFO L482 AbstractCegarLoop]: Abstraction has has 161 places, 239 transitions, 1427 flow [2021-08-13 01:08:53,331 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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-08-13 01:08:53,331 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:53,331 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:53,331 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 01:08:53,331 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash 631829687, now seen corresponding path program 1 times [2021-08-13 01:08:53,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:53,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532064596] [2021-08-13 01:08:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:53,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:53,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:53,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:53,424 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:08:53,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:08:53,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:53,454 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:08:53,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:53,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:53,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:53,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532064596] [2021-08-13 01:08:53,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532064596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:53,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:53,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 01:08:53,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538148166] [2021-08-13 01:08:53,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 01:08:53,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 01:08:53,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 01:08:53,467 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-08-13 01:08:53,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 239 transitions, 1427 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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-08-13 01:08:53,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:53,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-08-13 01:08:53,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:53,903 INFO L129 PetriNetUnfolder]: 530/1771 cut-off events. [2021-08-13 01:08:53,904 INFO L130 PetriNetUnfolder]: For 367/1970 co-relation queries the response was YES. [2021-08-13 01:08:53,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 1771 events. 530/1771 cut-off events. For 367/1970 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 15111 event pairs, 35 based on Foata normal form. 255/1900 useless extension candidates. Maximal degree in co-relation 4476. Up to 370 conditions per place. [2021-08-13 01:08:53,921 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 22 selfloop transitions, 44 changer transitions 48/216 dead transitions. [2021-08-13 01:08:53,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 216 transitions, 1173 flow [2021-08-13 01:08:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 01:08:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 01:08:53,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1266 transitions. [2021-08-13 01:08:53,924 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.910136592379583 [2021-08-13 01:08:53,924 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1266 transitions. [2021-08-13 01:08:53,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1266 transitions. [2021-08-13 01:08:53,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:53,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1266 transitions. [2021-08-13 01:08:53,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.38461538461539) internal successors, (1266), 13 states have internal predecessors, (1266), 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-08-13 01:08:53,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-13 01:08:53,931 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 107.0) internal successors, (1498), 14 states have internal predecessors, (1498), 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-08-13 01:08:53,931 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 52 predicate places. [2021-08-13 01:08:53,931 INFO L482 AbstractCegarLoop]: Abstraction has has 164 places, 216 transitions, 1173 flow [2021-08-13 01:08:53,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 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-08-13 01:08:53,931 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:53,931 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:53,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 01:08:53,932 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:53,932 INFO L82 PathProgramCache]: Analyzing trace with hash 673178697, now seen corresponding path program 1 times [2021-08-13 01:08:53,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:53,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276703390] [2021-08-13 01:08:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:53,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:53,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:53,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:53,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:53,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:54,003 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 01:08:54,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 01:08:54,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:54,032 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 01:08:54,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:54,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:54,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:54,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276703390] [2021-08-13 01:08:54,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276703390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:54,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:54,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 01:08:54,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862173501] [2021-08-13 01:08:54,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 01:08:54,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 01:08:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 01:08:54,047 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2021-08-13 01:08:54,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 216 transitions, 1173 flow. Second operand has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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-08-13 01:08:54,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:54,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2021-08-13 01:08:54,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:54,415 INFO L129 PetriNetUnfolder]: 449/1424 cut-off events. [2021-08-13 01:08:54,415 INFO L130 PetriNetUnfolder]: For 638/3447 co-relation queries the response was YES. [2021-08-13 01:08:54,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4447 conditions, 1424 events. 449/1424 cut-off events. For 638/3447 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 12249 event pairs, 5 based on Foata normal form. 316/1636 useless extension candidates. Maximal degree in co-relation 4370. Up to 354 conditions per place. [2021-08-13 01:08:54,429 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 48 changer transitions 58/217 dead transitions. [2021-08-13 01:08:54,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 217 transitions, 1337 flow [2021-08-13 01:08:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 01:08:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 01:08:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1544 transitions. [2021-08-13 01:08:54,433 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9018691588785047 [2021-08-13 01:08:54,433 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1544 transitions. [2021-08-13 01:08:54,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1544 transitions. [2021-08-13 01:08:54,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:54,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1544 transitions. [2021-08-13 01:08:54,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 96.5) internal successors, (1544), 16 states have internal predecessors, (1544), 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-08-13 01:08:54,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-13 01:08:54,441 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 107.0) internal successors, (1819), 17 states have internal predecessors, (1819), 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-08-13 01:08:54,441 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 55 predicate places. [2021-08-13 01:08:54,441 INFO L482 AbstractCegarLoop]: Abstraction has has 167 places, 217 transitions, 1337 flow [2021-08-13 01:08:54,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 94.125) internal successors, (753), 8 states have internal predecessors, (753), 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-08-13 01:08:54,442 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:54,442 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:54,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 01:08:54,442 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -325644249, now seen corresponding path program 1 times [2021-08-13 01:08:54,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:54,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725751778] [2021-08-13 01:08:54,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:54,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:54,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:54,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:54,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:54,552 INFO L142 QuantifierPusher]: treesize reduction 5, result has 79.2 percent of original size [2021-08-13 01:08:54,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:54,570 INFO L142 QuantifierPusher]: treesize reduction 5, result has 79.2 percent of original size [2021-08-13 01:08:54,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:54,587 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-08-13 01:08:54,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-13 01:08:54,603 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.0 percent of original size [2021-08-13 01:08:54,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-13 01:08:54,624 INFO L142 QuantifierPusher]: treesize reduction 23, result has 43.9 percent of original size [2021-08-13 01:08:54,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-13 01:08:54,634 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:54,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:54,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:54,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:54,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:54,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:54,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:54,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725751778] [2021-08-13 01:08:54,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725751778] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:54,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:54,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 01:08:54,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931806442] [2021-08-13 01:08:54,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 01:08:54,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:54,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 01:08:54,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-13 01:08:54,680 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2021-08-13 01:08:54,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 217 transitions, 1337 flow. Second operand has 13 states, 13 states have (on average 84.46153846153847) internal successors, (1098), 13 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:08:54,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:54,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2021-08-13 01:08:54,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:55,355 INFO L129 PetriNetUnfolder]: 1023/3098 cut-off events. [2021-08-13 01:08:55,355 INFO L130 PetriNetUnfolder]: For 1801/3241 co-relation queries the response was YES. [2021-08-13 01:08:55,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10099 conditions, 3098 events. 1023/3098 cut-off events. For 1801/3241 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 32705 event pairs, 5 based on Foata normal form. 13/2865 useless extension candidates. Maximal degree in co-relation 10014. Up to 758 conditions per place. [2021-08-13 01:08:55,387 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 27 selfloop transitions, 9 changer transitions 102/266 dead transitions. [2021-08-13 01:08:55,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 266 transitions, 1905 flow [2021-08-13 01:08:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 01:08:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 01:08:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1041 transitions. [2021-08-13 01:08:55,391 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8107476635514018 [2021-08-13 01:08:55,392 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1041 transitions. [2021-08-13 01:08:55,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1041 transitions. [2021-08-13 01:08:55,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:55,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1041 transitions. [2021-08-13 01:08:55,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.75) internal successors, (1041), 12 states have internal predecessors, (1041), 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-08-13 01:08:55,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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-08-13 01:08:55,398 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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-08-13 01:08:55,398 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 66 predicate places. [2021-08-13 01:08:55,398 INFO L482 AbstractCegarLoop]: Abstraction has has 178 places, 266 transitions, 1905 flow [2021-08-13 01:08:55,399 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 84.46153846153847) internal successors, (1098), 13 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:08:55,399 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:55,399 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:55,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 01:08:55,399 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1545171561, now seen corresponding path program 2 times [2021-08-13 01:08:55,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:55,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088071711] [2021-08-13 01:08:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:55,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:55,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:55,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:55,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 01:08:55,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:08:55,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:55,562 INFO L142 QuantifierPusher]: treesize reduction 30, result has 58.9 percent of original size [2021-08-13 01:08:55,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-08-13 01:08:55,586 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:55,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:55,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:55,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:55,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:55,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:55,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:55,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088071711] [2021-08-13 01:08:55,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088071711] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:55,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:55,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 01:08:55,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073006414] [2021-08-13 01:08:55,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 01:08:55,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 01:08:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-13 01:08:55,627 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 107 [2021-08-13 01:08:55,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 266 transitions, 1905 flow. Second operand has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 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-08-13 01:08:55,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:55,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 107 [2021-08-13 01:08:55,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:56,299 INFO L129 PetriNetUnfolder]: 1614/4608 cut-off events. [2021-08-13 01:08:56,299 INFO L130 PetriNetUnfolder]: For 2874/4873 co-relation queries the response was YES. [2021-08-13 01:08:56,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15588 conditions, 4608 events. 1614/4608 cut-off events. For 2874/4873 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 51138 event pairs, 4 based on Foata normal form. 45/4301 useless extension candidates. Maximal degree in co-relation 15496. Up to 1217 conditions per place. [2021-08-13 01:08:56,333 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 30 selfloop transitions, 11 changer transitions 131/303 dead transitions. [2021-08-13 01:08:56,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 303 transitions, 2561 flow [2021-08-13 01:08:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 01:08:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 01:08:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 805 transitions. [2021-08-13 01:08:56,335 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8359293873312564 [2021-08-13 01:08:56,335 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 805 transitions. [2021-08-13 01:08:56,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 805 transitions. [2021-08-13 01:08:56,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:56,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 805 transitions. [2021-08-13 01:08:56,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.44444444444444) internal successors, (805), 9 states have internal predecessors, (805), 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-08-13 01:08:56,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-08-13 01:08:56,339 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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-08-13 01:08:56,339 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 74 predicate places. [2021-08-13 01:08:56,339 INFO L482 AbstractCegarLoop]: Abstraction has has 186 places, 303 transitions, 2561 flow [2021-08-13 01:08:56,340 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 87.54545454545455) internal successors, (963), 11 states have internal predecessors, (963), 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-08-13 01:08:56,340 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:56,340 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:56,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 01:08:56,340 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1928108373, now seen corresponding path program 3 times [2021-08-13 01:08:56,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:56,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567230083] [2021-08-13 01:08:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 01:08:56,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:56,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 01:08:56,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 01:08:56,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 01:08:56,488 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-08-13 01:08:56,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-08-13 01:08:56,509 INFO L142 QuantifierPusher]: treesize reduction 47, result has 60.5 percent of original size [2021-08-13 01:08:56,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-08-13 01:08:56,549 INFO L142 QuantifierPusher]: treesize reduction 47, result has 61.5 percent of original size [2021-08-13 01:08:56,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-08-13 01:08:56,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 01:08:56,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 01:08:56,627 INFO L142 QuantifierPusher]: treesize reduction 21, result has 73.1 percent of original size [2021-08-13 01:08:56,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-08-13 01:08:56,651 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 01:08:56,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 01:08:56,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:56,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 01:08:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 01:08:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 01:08:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 01:08:56,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 01:08:56,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567230083] [2021-08-13 01:08:56,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567230083] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 01:08:56,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 01:08:56,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-13 01:08:56,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214180564] [2021-08-13 01:08:56,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-13 01:08:56,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 01:08:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-13 01:08:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-08-13 01:08:56,695 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2021-08-13 01:08:56,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 303 transitions, 2561 flow. Second operand has 14 states, 14 states have (on average 83.42857142857143) internal successors, (1168), 14 states have internal predecessors, (1168), 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-08-13 01:08:56,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 01:08:56,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2021-08-13 01:08:56,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 01:08:57,645 INFO L129 PetriNetUnfolder]: 2488/6852 cut-off events. [2021-08-13 01:08:57,645 INFO L130 PetriNetUnfolder]: For 4232/7189 co-relation queries the response was YES. [2021-08-13 01:08:57,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23478 conditions, 6852 events. 2488/6852 cut-off events. For 4232/7189 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 79036 event pairs, 4 based on Foata normal form. 60/6384 useless extension candidates. Maximal degree in co-relation 23376. Up to 1929 conditions per place. [2021-08-13 01:08:57,687 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 29 selfloop transitions, 9 changer transitions 207/371 dead transitions. [2021-08-13 01:08:57,687 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 371 transitions, 3851 flow [2021-08-13 01:08:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 01:08:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 01:08:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1032 transitions. [2021-08-13 01:08:57,690 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8037383177570093 [2021-08-13 01:08:57,690 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1032 transitions. [2021-08-13 01:08:57,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1032 transitions. [2021-08-13 01:08:57,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 01:08:57,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1032 transitions. [2021-08-13 01:08:57,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.0) internal successors, (1032), 12 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 01:08:57,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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-08-13 01:08:57,694 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 107.0) internal successors, (1391), 13 states have internal predecessors, (1391), 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-08-13 01:08:57,694 INFO L348 CegarLoopForPetriNet]: 112 programPoint places, 85 predicate places. [2021-08-13 01:08:57,694 INFO L482 AbstractCegarLoop]: Abstraction has has 197 places, 371 transitions, 3851 flow [2021-08-13 01:08:57,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 83.42857142857143) internal successors, (1168), 14 states have internal predecessors, (1168), 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-08-13 01:08:57,695 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 01:08:57,695 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 01:08:57,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 01:08:57,695 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 01:08:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 01:08:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1173469913, now seen corresponding path program 4 times [2021-08-13 01:08:57,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 01:08:57,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888142106] [2021-08-13 01:08:57,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 01:08:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:08:57,734 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:08:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 01:08:57,772 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 01:08:57,805 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 01:08:57,805 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 01:08:57,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 01:08:57,808 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 01:08:57,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 01:08:57 BasicIcfg [2021-08-13 01:08:57,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 01:08:57,942 INFO L168 Benchmark]: Toolchain (without parser) took 12939.49 ms. Allocated memory was 178.3 MB in the beginning and 1.0 GB in the end (delta: 856.7 MB). Free memory was 142.4 MB in the beginning and 546.1 MB in the end (delta: -403.8 MB). Peak memory consumption was 453.9 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,943 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 178.3 MB. Free memory is still 160.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 01:08:57,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.22 ms. Allocated memory is still 178.3 MB. Free memory was 142.1 MB in the beginning and 136.5 MB in the end (delta: 5.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.28 ms. Allocated memory is still 178.3 MB. Free memory was 136.5 MB in the beginning and 133.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,944 INFO L168 Benchmark]: Boogie Preprocessor took 53.65 ms. Allocated memory is still 178.3 MB. Free memory was 133.4 MB in the beginning and 131.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,944 INFO L168 Benchmark]: RCFGBuilder took 2050.17 ms. Allocated memory was 178.3 MB in the beginning and 245.4 MB in the end (delta: 67.1 MB). Free memory was 131.3 MB in the beginning and 112.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,944 INFO L168 Benchmark]: TraceAbstraction took 10279.16 ms. Allocated memory was 245.4 MB in the beginning and 1.0 GB in the end (delta: 789.6 MB). Free memory was 111.5 MB in the beginning and 546.1 MB in the end (delta: -434.6 MB). Peak memory consumption was 354.5 MB. Max. memory is 8.0 GB. [2021-08-13 01:08:57,949 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.14 ms. Allocated memory is still 178.3 MB. Free memory is still 160.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 474.22 ms. Allocated memory is still 178.3 MB. Free memory was 142.1 MB in the beginning and 136.5 MB in the end (delta: 5.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 76.28 ms. Allocated memory is still 178.3 MB. Free memory was 136.5 MB in the beginning and 133.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.65 ms. Allocated memory is still 178.3 MB. Free memory was 133.4 MB in the beginning and 131.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2050.17 ms. Allocated memory was 178.3 MB in the beginning and 245.4 MB in the end (delta: 67.1 MB). Free memory was 131.3 MB in the beginning and 112.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 87.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10279.16 ms. Allocated memory was 245.4 MB in the beginning and 1.0 GB in the end (delta: 789.6 MB). Free memory was 111.5 MB in the beginning and 546.1 MB in the end (delta: -434.6 MB). Peak memory consumption was 354.5 MB. Max. memory is 8.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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2290; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t2290, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2291; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t2291, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 0 pthread_t t2292; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L825] FCALL, FORK 0 pthread_create(&t2292, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 22.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10027.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7183.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 68.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 126 SDtfs, 459 SDslu, 513 SDs, 0 SdLazy, 949 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1001.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1838.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3851occurred in iteration=11, InterpolantAutomatonStates: 128, 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: 58.0ms SsaConstructionTime, 562.0ms SatisfiabilityAnalysisTime, 1831.4ms InterpolantComputationTime, 892 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 798 ConstructedInterpolants, 0 QuantifiedInterpolants, 4769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...