/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-12 20:56:03,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-12 20:56:03,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-12 20:56:03,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-12 20:56:03,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-12 20:56:03,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-12 20:56:03,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-12 20:56:03,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-12 20:56:03,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-12 20:56:03,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-12 20:56:03,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-12 20:56:03,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-12 20:56:03,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-12 20:56:03,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-12 20:56:03,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-12 20:56:03,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-12 20:56:03,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-12 20:56:03,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-12 20:56:03,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-12 20:56:03,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-12 20:56:03,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-12 20:56:03,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-12 20:56:03,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-12 20:56:03,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-12 20:56:03,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-12 20:56:03,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-12 20:56:03,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-12 20:56:03,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-12 20:56:03,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-12 20:56:03,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-12 20:56:03,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-12 20:56:03,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-12 20:56:03,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-12 20:56:03,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-12 20:56:03,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-12 20:56:03,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-12 20:56:03,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-12 20:56:03,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-12 20:56:03,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-12 20:56:03,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-12 20:56:03,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-12 20:56:03,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-08-12 20:56:03,552 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-12 20:56:03,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-12 20:56:03,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * Use SBE=true [2021-08-12 20:56:03,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-12 20:56:03,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-12 20:56:03,557 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-12 20:56:03,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-12 20:56:03,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-12 20:56:03,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-12 20:56:03,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-12 20:56:03,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-12 20:56:03,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-12 20:56:03,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-12 20:56:03,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-12 20:56:03,559 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-12 20:56:03,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-12 20:56:03,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-12 20:56:03,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-12 20:56:03,859 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-12 20:56:03,861 INFO L275 PluginConnector]: CDTParser initialized [2021-08-12 20:56:03,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2021-08-12 20:56:03,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b4786a/5f6180b352b84f3889fc5afb6afe14d8/FLAGde44052ef [2021-08-12 20:56:04,330 INFO L306 CDTParser]: Found 1 translation units. [2021-08-12 20:56:04,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2021-08-12 20:56:04,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b4786a/5f6180b352b84f3889fc5afb6afe14d8/FLAGde44052ef [2021-08-12 20:56:04,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/815b4786a/5f6180b352b84f3889fc5afb6afe14d8 [2021-08-12 20:56:04,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-12 20:56:04,351 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-12 20:56:04,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-12 20:56:04,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-12 20:56:04,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-12 20:56:04,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513dcb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04, skipping insertion in model container [2021-08-12 20:56:04,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-12 20:56:04,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-12 20:56:04,504 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/mix057_rmo.opt.i[948,961] [2021-08-12 20:56:04,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:56:04,650 INFO L203 MainTranslator]: Completed pre-run [2021-08-12 20:56:04,659 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/mix057_rmo.opt.i[948,961] [2021-08-12 20:56:04,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-12 20:56:04,749 INFO L208 MainTranslator]: Completed translation [2021-08-12 20:56:04,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04 WrapperNode [2021-08-12 20:56:04,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-12 20:56:04,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-12 20:56:04,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-12 20:56:04,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-12 20:56:04,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-12 20:56:04,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-12 20:56:04,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-12 20:56:04,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-12 20:56:04,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (1/1) ... [2021-08-12 20:56:04,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-12 20:56:04,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-12 20:56:04,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-12 20:56:04,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-12 20:56:04,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (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-12 20:56:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-12 20:56:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-12 20:56:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-12 20:56:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-12 20:56:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-12 20:56:04,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-12 20:56:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-12 20:56:04,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-12 20:56:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-12 20:56:04,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-12 20:56:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-12 20:56:04,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-12 20:56:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-12 20:56:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-12 20:56:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-12 20:56:04,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-12 20:56:04,933 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-12 20:56:06,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-12 20:56:06,314 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-12 20:56:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:56:06 BoogieIcfgContainer [2021-08-12 20:56:06,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-12 20:56:06,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-12 20:56:06,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-12 20:56:06,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-12 20:56:06,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.08 08:56:04" (1/3) ... [2021-08-12 20:56:06,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd10319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:56:06, skipping insertion in model container [2021-08-12 20:56:06,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.08 08:56:04" (2/3) ... [2021-08-12 20:56:06,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd10319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.08 08:56:06, skipping insertion in model container [2021-08-12 20:56:06,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.08 08:56:06" (3/3) ... [2021-08-12 20:56:06,320 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2021-08-12 20:56:06,324 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-12 20:56:06,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-12 20:56:06,325 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,351 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,356 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-12 20:56:06,363 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-12 20:56:06,377 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-12 20:56:06,390 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-12 20:56:06,390 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-12 20:56:06,390 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-12 20:56:06,391 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-12 20:56:06,391 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-12 20:56:06,391 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-12 20:56:06,391 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-12 20:56:06,391 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-12 20:56:06,398 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2021-08-12 20:56:06,442 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2021-08-12 20:56:06,442 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:56:06,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-08-12 20:56:06,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 124 transitions, 268 flow [2021-08-12 20:56:06,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 120 transitions, 252 flow [2021-08-12 20:56:06,461 INFO L129 PetriNetUnfolder]: 0/85 cut-off events. [2021-08-12 20:56:06,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:56:06,461 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:06,462 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] [2021-08-12 20:56:06,462 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1183912701, now seen corresponding path program 1 times [2021-08-12 20:56:06,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:06,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476169251] [2021-08-12 20:56:06,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:06,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:06,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:06,685 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-12 20:56:06,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:06,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476169251] [2021-08-12 20:56:06,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476169251] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:06,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:06,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-12 20:56:06,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829649911] [2021-08-12 20:56:06,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-12 20:56:06,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-12 20:56:06,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-12 20:56:06,706 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 124 [2021-08-12 20:56:06,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 120 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-12 20:56:06,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:06,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 124 [2021-08-12 20:56:06,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:06,791 INFO L129 PetriNetUnfolder]: 16/242 cut-off events. [2021-08-12 20:56:06,791 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-12 20:56:06,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 242 events. 16/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 722 event pairs, 6 based on Foata normal form. 9/240 useless extension candidates. Maximal degree in co-relation 239. Up to 27 conditions per place. [2021-08-12 20:56:06,794 INFO L132 encePairwiseOnDemand]: 119/124 looper letters, 7 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2021-08-12 20:56:06,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 119 transitions, 268 flow [2021-08-12 20:56:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-12 20:56:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-12 20:56:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-08-12 20:56:06,803 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.956989247311828 [2021-08-12 20:56:06,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-08-12 20:56:06,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-08-12 20:56:06,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:06,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-08-12 20:56:06,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-12 20:56:06,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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-12 20:56:06,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 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-12 20:56:06,813 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2021-08-12 20:56:06,814 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 119 transitions, 268 flow [2021-08-12 20:56:06,814 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-12 20:56:06,814 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:06,814 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] [2021-08-12 20:56:06,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-12 20:56:06,814 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:06,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:06,815 INFO L82 PathProgramCache]: Analyzing trace with hash -715615938, now seen corresponding path program 1 times [2021-08-12 20:56:06,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:06,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966524917] [2021-08-12 20:56:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:06,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:06,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:06,942 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:06,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:06,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:06,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:06,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:06,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:06,972 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-12 20:56:06,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:06,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966524917] [2021-08-12 20:56:06,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966524917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:06,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:06,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:56:06,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136355903] [2021-08-12 20:56:06,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:56:06,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:56:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:56:06,977 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 124 [2021-08-12 20:56:06,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 119 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-12 20:56:06,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:06,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 124 [2021-08-12 20:56:06,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:07,176 INFO L129 PetriNetUnfolder]: 143/846 cut-off events. [2021-08-12 20:56:07,176 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-08-12 20:56:07,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 846 events. 143/846 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6134 event pairs, 34 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1150. Up to 149 conditions per place. [2021-08-12 20:56:07,185 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 10 selfloop transitions, 3 changer transitions 22/143 dead transitions. [2021-08-12 20:56:07,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 390 flow [2021-08-12 20:56:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:56:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:56:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1034 transitions. [2021-08-12 20:56:07,193 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9265232974910395 [2021-08-12 20:56:07,193 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1034 transitions. [2021-08-12 20:56:07,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1034 transitions. [2021-08-12 20:56:07,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:07,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1034 transitions. [2021-08-12 20:56:07,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-12 20:56:07,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:07,204 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:07,204 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 8 predicate places. [2021-08-12 20:56:07,204 INFO L482 AbstractCegarLoop]: Abstraction has has 139 places, 143 transitions, 390 flow [2021-08-12 20:56:07,205 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-12 20:56:07,205 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:07,205 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] [2021-08-12 20:56:07,205 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-12 20:56:07,205 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:07,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:07,207 INFO L82 PathProgramCache]: Analyzing trace with hash -192323841, now seen corresponding path program 1 times [2021-08-12 20:56:07,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:07,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105514922] [2021-08-12 20:56:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:07,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:07,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:07,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:07,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:07,401 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-12 20:56:07,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-12 20:56:07,413 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:07,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:07,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:07,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:07,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:07,449 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-12 20:56:07,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:07,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105514922] [2021-08-12 20:56:07,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105514922] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:07,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:07,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:56:07,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626549610] [2021-08-12 20:56:07,451 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:56:07,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:56:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:56:07,454 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 124 [2021-08-12 20:56:07,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 143 transitions, 390 flow. Second operand has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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-12 20:56:07,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:07,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 124 [2021-08-12 20:56:07,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:07,813 INFO L129 PetriNetUnfolder]: 545/1965 cut-off events. [2021-08-12 20:56:07,814 INFO L130 PetriNetUnfolder]: For 346/426 co-relation queries the response was YES. [2021-08-12 20:56:07,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1965 events. 545/1965 cut-off events. For 346/426 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16780 event pairs, 83 based on Foata normal form. 0/1921 useless extension candidates. Maximal degree in co-relation 3519. Up to 312 conditions per place. [2021-08-12 20:56:07,823 INFO L132 encePairwiseOnDemand]: 115/124 looper letters, 17 selfloop transitions, 5 changer transitions 85/199 dead transitions. [2021-08-12 20:56:07,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 199 transitions, 774 flow [2021-08-12 20:56:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-12 20:56:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-12 20:56:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1217 transitions. [2021-08-12 20:56:07,826 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8922287390029325 [2021-08-12 20:56:07,826 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1217 transitions. [2021-08-12 20:56:07,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1217 transitions. [2021-08-12 20:56:07,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:07,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1217 transitions. [2021-08-12 20:56:07,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 110.63636363636364) internal successors, (1217), 11 states have internal predecessors, (1217), 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-12 20:56:07,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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-12 20:56:07,831 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 124.0) internal successors, (1488), 12 states have internal predecessors, (1488), 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-12 20:56:07,831 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 18 predicate places. [2021-08-12 20:56:07,831 INFO L482 AbstractCegarLoop]: Abstraction has has 149 places, 199 transitions, 774 flow [2021-08-12 20:56:07,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 107.25) internal successors, (858), 8 states have internal predecessors, (858), 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-12 20:56:07,832 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:07,832 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] [2021-08-12 20:56:07,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-12 20:56:07,832 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1926736287, now seen corresponding path program 1 times [2021-08-12 20:56:07,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:07,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667842225] [2021-08-12 20:56:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:07,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:07,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:07,936 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:07,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:07,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:07,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:07,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:07,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:07,962 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-12 20:56:07,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:07,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667842225] [2021-08-12 20:56:07,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667842225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:07,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:07,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:56:07,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612681942] [2021-08-12 20:56:07,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:56:07,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:56:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:56:07,964 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 124 [2021-08-12 20:56:07,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 199 transitions, 774 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-12 20:56:07,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:07,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 124 [2021-08-12 20:56:07,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:09,139 INFO L129 PetriNetUnfolder]: 3490/9865 cut-off events. [2021-08-12 20:56:09,139 INFO L130 PetriNetUnfolder]: For 2863/3031 co-relation queries the response was YES. [2021-08-12 20:56:09,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19727 conditions, 9865 events. 3490/9865 cut-off events. For 2863/3031 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 108984 event pairs, 649 based on Foata normal form. 1/9645 useless extension candidates. Maximal degree in co-relation 19665. Up to 1306 conditions per place. [2021-08-12 20:56:09,196 INFO L132 encePairwiseOnDemand]: 117/124 looper letters, 9 selfloop transitions, 3 changer transitions 176/292 dead transitions. [2021-08-12 20:56:09,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 292 transitions, 1572 flow [2021-08-12 20:56:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:56:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:56:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1034 transitions. [2021-08-12 20:56:09,199 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9265232974910395 [2021-08-12 20:56:09,199 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1034 transitions. [2021-08-12 20:56:09,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1034 transitions. [2021-08-12 20:56:09,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:09,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1034 transitions. [2021-08-12 20:56:09,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-12 20:56:09,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:09,206 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:09,206 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 26 predicate places. [2021-08-12 20:56:09,206 INFO L482 AbstractCegarLoop]: Abstraction has has 157 places, 292 transitions, 1572 flow [2021-08-12 20:56:09,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 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-12 20:56:09,207 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:09,207 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] [2021-08-12 20:56:09,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-12 20:56:09,207 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash -807069038, now seen corresponding path program 1 times [2021-08-12 20:56:09,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:09,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677476865] [2021-08-12 20:56:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:09,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:09,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:09,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:09,344 INFO L142 QuantifierPusher]: treesize reduction 20, result has 78.9 percent of original size [2021-08-12 20:56:09,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-08-12 20:56:09,356 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-08-12 20:56:09,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-08-12 20:56:09,376 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:09,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:09,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:09,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:09,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:09,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:09,406 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-12 20:56:09,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:09,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677476865] [2021-08-12 20:56:09,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677476865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:09,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:09,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:56:09,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96000684] [2021-08-12 20:56:09,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:56:09,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:56:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:56:09,409 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 124 [2021-08-12 20:56:09,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 292 transitions, 1572 flow. Second operand has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 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-12 20:56:09,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:09,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 124 [2021-08-12 20:56:09,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:10,701 INFO L129 PetriNetUnfolder]: 3914/10988 cut-off events. [2021-08-12 20:56:10,701 INFO L130 PetriNetUnfolder]: For 4176/4981 co-relation queries the response was YES. [2021-08-12 20:56:10,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26010 conditions, 10988 events. 3914/10988 cut-off events. For 4176/4981 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 123627 event pairs, 492 based on Foata normal form. 25/10825 useless extension candidates. Maximal degree in co-relation 25943. Up to 2637 conditions per place. [2021-08-12 20:56:10,764 INFO L132 encePairwiseOnDemand]: 115/124 looper letters, 22 selfloop transitions, 7 changer transitions 328/451 dead transitions. [2021-08-12 20:56:10,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 451 transitions, 3436 flow [2021-08-12 20:56:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-12 20:56:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-12 20:56:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1531 transitions. [2021-08-12 20:56:10,767 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8819124423963134 [2021-08-12 20:56:10,767 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1531 transitions. [2021-08-12 20:56:10,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1531 transitions. [2021-08-12 20:56:10,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:10,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1531 transitions. [2021-08-12 20:56:10,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.35714285714286) internal successors, (1531), 14 states have internal predecessors, (1531), 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-12 20:56:10,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 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-12 20:56:10,773 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 124.0) internal successors, (1860), 15 states have internal predecessors, (1860), 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-12 20:56:10,773 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 39 predicate places. [2021-08-12 20:56:10,773 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 451 transitions, 3436 flow [2021-08-12 20:56:10,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 106.375) internal successors, (851), 8 states have internal predecessors, (851), 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-12 20:56:10,773 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:10,773 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-12 20:56:10,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-12 20:56:10,773 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash -909175487, now seen corresponding path program 1 times [2021-08-12 20:56:10,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:10,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574387108] [2021-08-12 20:56:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:10,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:10,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:10,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:10,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:10,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:56:10,900 INFO L142 QuantifierPusher]: treesize reduction 16, result has 86.0 percent of original size [2021-08-12 20:56:10,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-08-12 20:56:10,911 INFO L142 QuantifierPusher]: treesize reduction 16, result has 86.3 percent of original size [2021-08-12 20:56:10,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2021-08-12 20:56:10,940 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-08-12 20:56:10,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-08-12 20:56:10,958 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:10,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:10,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:10,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:10,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:10,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:10,988 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-12 20:56:10,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:10,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574387108] [2021-08-12 20:56:10,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574387108] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:10,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:10,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-12 20:56:10,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037146791] [2021-08-12 20:56:10,989 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-12 20:56:10,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:10,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-12 20:56:10,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-12 20:56:10,990 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 124 [2021-08-12 20:56:10,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 451 transitions, 3436 flow. Second operand has 11 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 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-12 20:56:10,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:10,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 124 [2021-08-12 20:56:10,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:12,708 INFO L129 PetriNetUnfolder]: 4844/13802 cut-off events. [2021-08-12 20:56:12,709 INFO L130 PetriNetUnfolder]: For 6377/8237 co-relation queries the response was YES. [2021-08-12 20:56:12,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37587 conditions, 13802 events. 4844/13802 cut-off events. For 6377/8237 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 162540 event pairs, 505 based on Foata normal form. 109/13712 useless extension candidates. Maximal degree in co-relation 37513. Up to 3524 conditions per place. [2021-08-12 20:56:12,784 INFO L132 encePairwiseOnDemand]: 112/124 looper letters, 21 selfloop transitions, 12 changer transitions 442/567 dead transitions. [2021-08-12 20:56:12,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 567 transitions, 5420 flow [2021-08-12 20:56:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-12 20:56:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-12 20:56:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1825 transitions. [2021-08-12 20:56:12,788 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8657495256166983 [2021-08-12 20:56:12,788 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1825 transitions. [2021-08-12 20:56:12,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1825 transitions. [2021-08-12 20:56:12,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:12,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1825 transitions. [2021-08-12 20:56:12,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 107.3529411764706) internal successors, (1825), 17 states have internal predecessors, (1825), 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-12 20:56:12,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 124.0) internal successors, (2232), 18 states have internal predecessors, (2232), 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-12 20:56:12,795 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 124.0) internal successors, (2232), 18 states have internal predecessors, (2232), 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-12 20:56:12,795 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 55 predicate places. [2021-08-12 20:56:12,795 INFO L482 AbstractCegarLoop]: Abstraction has has 186 places, 567 transitions, 5420 flow [2021-08-12 20:56:12,795 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 104.27272727272727) internal successors, (1147), 11 states have internal predecessors, (1147), 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-12 20:56:12,796 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:12,796 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, 1] [2021-08-12 20:56:12,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-12 20:56:12,796 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 945574058, now seen corresponding path program 1 times [2021-08-12 20:56:12,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:12,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615191184] [2021-08-12 20:56:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:12,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:12,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:12,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:12,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:12,844 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:12,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:12,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:12,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:12,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:12,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:12,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:12,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:12,867 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-12 20:56:12,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:12,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615191184] [2021-08-12 20:56:12,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615191184] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:12,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:12,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:56:12,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357758238] [2021-08-12 20:56:12,868 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:56:12,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:12,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:56:12,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:56:12,869 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 124 [2021-08-12 20:56:12,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 567 transitions, 5420 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-12 20:56:12,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:12,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 124 [2021-08-12 20:56:12,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:14,943 INFO L129 PetriNetUnfolder]: 5454/17905 cut-off events. [2021-08-12 20:56:14,944 INFO L130 PetriNetUnfolder]: For 14413/16708 co-relation queries the response was YES. [2021-08-12 20:56:15,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52523 conditions, 17905 events. 5454/17905 cut-off events. For 14413/16708 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 237456 event pairs, 269 based on Foata normal form. 37/17747 useless extension candidates. Maximal degree in co-relation 52446. Up to 4604 conditions per place. [2021-08-12 20:56:15,161 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 20 selfloop transitions, 3 changer transitions 721/854 dead transitions. [2021-08-12 20:56:15,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 854 transitions, 10150 flow [2021-08-12 20:56:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:56:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:56:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2021-08-12 20:56:15,163 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9220430107526881 [2021-08-12 20:56:15,163 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1029 transitions. [2021-08-12 20:56:15,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1029 transitions. [2021-08-12 20:56:15,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:15,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1029 transitions. [2021-08-12 20:56:15,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 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-12 20:56:15,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:15,167 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:15,167 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 63 predicate places. [2021-08-12 20:56:15,167 INFO L482 AbstractCegarLoop]: Abstraction has has 194 places, 854 transitions, 10150 flow [2021-08-12 20:56:15,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-12 20:56:15,168 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:15,168 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, 1, 1] [2021-08-12 20:56:15,168 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-12 20:56:15,168 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1041936237, now seen corresponding path program 1 times [2021-08-12 20:56:15,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:15,168 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946916079] [2021-08-12 20:56:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:15,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:15,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:15,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:15,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:15,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-12 20:56:15,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:15,265 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-08-12 20:56:15,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-08-12 20:56:15,274 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:15,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:15,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:15,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:15,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:15,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:15,303 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-12 20:56:15,303 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:15,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946916079] [2021-08-12 20:56:15,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946916079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:15,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:15,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-12 20:56:15,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711463644] [2021-08-12 20:56:15,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-12 20:56:15,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:15,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-12 20:56:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-12 20:56:15,305 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 124 [2021-08-12 20:56:15,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 854 transitions, 10150 flow. Second operand has 10 states, 10 states have (on average 105.5) internal successors, (1055), 10 states have internal predecessors, (1055), 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-12 20:56:15,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:15,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 124 [2021-08-12 20:56:15,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:18,482 INFO L129 PetriNetUnfolder]: 6601/21735 cut-off events. [2021-08-12 20:56:18,482 INFO L130 PetriNetUnfolder]: For 22619/26710 co-relation queries the response was YES. [2021-08-12 20:56:18,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71516 conditions, 21735 events. 6601/21735 cut-off events. For 22619/26710 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 297522 event pairs, 311 based on Foata normal form. 154/21664 useless extension candidates. Maximal degree in co-relation 71432. Up to 5929 conditions per place. [2021-08-12 20:56:18,631 INFO L132 encePairwiseOnDemand]: 113/124 looper letters, 38 selfloop transitions, 13 changer transitions 1024/1167 dead transitions. [2021-08-12 20:56:18,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1167 transitions, 16482 flow [2021-08-12 20:56:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-12 20:56:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-12 20:56:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions. [2021-08-12 20:56:18,634 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-08-12 20:56:18,634 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions. [2021-08-12 20:56:18,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions. [2021-08-12 20:56:18,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:18,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions. [2021-08-12 20:56:18,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 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-12 20:56:18,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 124.0) internal successors, (1612), 13 states have internal predecessors, (1612), 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-12 20:56:18,639 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 124.0) internal successors, (1612), 13 states have internal predecessors, (1612), 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-12 20:56:18,639 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 74 predicate places. [2021-08-12 20:56:18,639 INFO L482 AbstractCegarLoop]: Abstraction has has 205 places, 1167 transitions, 16482 flow [2021-08-12 20:56:18,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 105.5) internal successors, (1055), 10 states have internal predecessors, (1055), 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-12 20:56:18,640 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:18,640 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, 1, 1] [2021-08-12 20:56:18,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-12 20:56:18,641 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash 630910577, now seen corresponding path program 2 times [2021-08-12 20:56:18,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:18,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170559266] [2021-08-12 20:56:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:18,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:18,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:18,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:18,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:18,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-12 20:56:18,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-12 20:56:18,753 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-12 20:56:18,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-12 20:56:18,915 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 11 [2021-08-12 20:56:18,919 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-08-12 20:56:18,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-08-12 20:56:18,940 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-08-12 20:56:18,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-12 20:56:18,955 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:18,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:18,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:18,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:18,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:18,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:18,994 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-12 20:56:18,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:18,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170559266] [2021-08-12 20:56:18,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170559266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:18,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:18,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-12 20:56:18,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463559969] [2021-08-12 20:56:18,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-12 20:56:18,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-12 20:56:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-12 20:56:18,996 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 124 [2021-08-12 20:56:18,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 1167 transitions, 16482 flow. Second operand has 13 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 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-12 20:56:18,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:18,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 124 [2021-08-12 20:56:18,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:23,492 INFO L129 PetriNetUnfolder]: 7096/23776 cut-off events. [2021-08-12 20:56:23,492 INFO L130 PetriNetUnfolder]: For 32183/38546 co-relation queries the response was YES. [2021-08-12 20:56:23,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86100 conditions, 23776 events. 7096/23776 cut-off events. For 32183/38546 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 332618 event pairs, 337 based on Foata normal form. 244/23787 useless extension candidates. Maximal degree in co-relation 86007. Up to 6579 conditions per place. [2021-08-12 20:56:23,622 INFO L132 encePairwiseOnDemand]: 112/124 looper letters, 41 selfloop transitions, 15 changer transitions 1216/1362 dead transitions. [2021-08-12 20:56:23,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1362 transitions, 21998 flow [2021-08-12 20:56:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-12 20:56:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-08-12 20:56:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2101 transitions. [2021-08-12 20:56:23,627 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8471774193548387 [2021-08-12 20:56:23,627 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2101 transitions. [2021-08-12 20:56:23,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2101 transitions. [2021-08-12 20:56:23,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:23,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2101 transitions. [2021-08-12 20:56:23,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 105.05) internal successors, (2101), 20 states have internal predecessors, (2101), 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-12 20:56:23,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 124.0) internal successors, (2604), 21 states have internal predecessors, (2604), 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-12 20:56:23,635 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 124.0) internal successors, (2604), 21 states have internal predecessors, (2604), 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-12 20:56:23,635 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 93 predicate places. [2021-08-12 20:56:23,635 INFO L482 AbstractCegarLoop]: Abstraction has has 224 places, 1362 transitions, 21998 flow [2021-08-12 20:56:23,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 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-12 20:56:23,635 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:23,635 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, 1, 1] [2021-08-12 20:56:23,636 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-12 20:56:23,636 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:23,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash -830414847, now seen corresponding path program 3 times [2021-08-12 20:56:23,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:23,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357624370] [2021-08-12 20:56:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:23,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:23,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:23,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:23,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-12 20:56:23,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:23,846 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-08-12 20:56:23,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:56:23,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-12 20:56:23,872 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.8 percent of original size [2021-08-12 20:56:23,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-08-12 20:56:23,889 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:23,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:23,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:23,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:23,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:23,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:23,926 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-12 20:56:23,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:23,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357624370] [2021-08-12 20:56:23,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357624370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:23,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:23,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-12 20:56:23,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775103060] [2021-08-12 20:56:23,927 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-12 20:56:23,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-12 20:56:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-12 20:56:23,928 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 124 [2021-08-12 20:56:23,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 1362 transitions, 21998 flow. Second operand has 12 states, 12 states have (on average 101.5) internal successors, (1218), 12 states have internal predecessors, (1218), 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-12 20:56:23,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:23,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 124 [2021-08-12 20:56:23,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:26,600 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_3 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_3, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][559], [64#L787true, 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 132#true, 229#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 134#true, 199#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0)), 136#true, 104#P3ENTRYtrue, 8#L18-1true, 138#true, 298#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 141#(= ~z$w_buff0_used~0 0), 337#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), 49#L765true, 177#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 273#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0)), 115#L750true, 158#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 255#(= ~y~0 1)]) [2021-08-12 20:56:26,600 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2021-08-12 20:56:26,600 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-08-12 20:56:26,601 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-08-12 20:56:26,601 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2021-08-12 20:56:27,172 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_3 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_3, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][632], [194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 132#true, 134#true, 198#(= ~z$r_buff0_thd0~0 0), 230#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 136#true, 8#L18-1true, 138#true, 139#true, 49#L765true, 113#L780true, 177#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 338#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 115#L750true, 275#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 307#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 89#L807true, 158#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 255#(= ~y~0 1)]) [2021-08-12 20:56:27,172 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2021-08-12 20:56:27,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-08-12 20:56:27,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-08-12 20:56:27,172 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2021-08-12 20:56:27,559 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_3 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_3, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][832], [64#L787true, 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 132#true, 198#(= ~z$r_buff0_thd0~0 0), 230#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 134#true, 8#L18-1true, 136#true, 297#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 138#true, 139#true, 177#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 273#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0)), 49#L765true, 338#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 115#L750true, 89#L807true, 158#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 255#(= ~y~0 1)]) [2021-08-12 20:56:27,559 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,559 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,560 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([780] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_3 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_3, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][833], [64#L787true, 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 226#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 132#true, 198#(= ~z$r_buff0_thd0~0 0), 134#true, 136#true, 8#L18-1true, 138#true, 139#true, 177#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 49#L765true, 338#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 275#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 307#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$r_buff1_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 115#L750true, 89#L807true, 158#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 255#(= ~y~0 1)]) [2021-08-12 20:56:27,560 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,560 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:27,561 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2021-08-12 20:56:28,850 INFO L129 PetriNetUnfolder]: 7357/26073 cut-off events. [2021-08-12 20:56:28,850 INFO L130 PetriNetUnfolder]: For 45978/54259 co-relation queries the response was YES. [2021-08-12 20:56:28,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101528 conditions, 26073 events. 7357/26073 cut-off events. For 45978/54259 co-relation queries the response was YES. Maximal size of possible extension queue 2046. Compared 378217 event pairs, 292 based on Foata normal form. 159/25956 useless extension candidates. Maximal degree in co-relation 101425. Up to 7071 conditions per place. [2021-08-12 20:56:29,022 INFO L132 encePairwiseOnDemand]: 114/124 looper letters, 55 selfloop transitions, 12 changer transitions 1438/1594 dead transitions. [2021-08-12 20:56:29,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1594 transitions, 29088 flow [2021-08-12 20:56:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:56:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:56:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1356 transitions. [2021-08-12 20:56:29,034 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8411910669975186 [2021-08-12 20:56:29,034 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1356 transitions. [2021-08-12 20:56:29,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1356 transitions. [2021-08-12 20:56:29,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:29,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1356 transitions. [2021-08-12 20:56:29,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 104.3076923076923) internal successors, (1356), 13 states have internal predecessors, (1356), 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-12 20:56:29,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 124.0) internal successors, (1736), 14 states have internal predecessors, (1736), 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-12 20:56:29,039 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 124.0) internal successors, (1736), 14 states have internal predecessors, (1736), 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-12 20:56:29,039 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 105 predicate places. [2021-08-12 20:56:29,039 INFO L482 AbstractCegarLoop]: Abstraction has has 236 places, 1594 transitions, 29088 flow [2021-08-12 20:56:29,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 101.5) internal successors, (1218), 12 states have internal predecessors, (1218), 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-12 20:56:29,039 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:56:29,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-12 20:56:29,040 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:29,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:29,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2086046755, now seen corresponding path program 1 times [2021-08-12 20:56:29,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:29,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221937502] [2021-08-12 20:56:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:29,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:29,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:29,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:29,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:29,263 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2021-08-12 20:56:29,264 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:56:29,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:56:29,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:29,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:29,283 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:56:29,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:29,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:29,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:29,289 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-12 20:56:29,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:29,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221937502] [2021-08-12 20:56:29,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221937502] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:29,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:29,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:56:29,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416697071] [2021-08-12 20:56:29,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:56:29,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:56:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:56:29,291 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2021-08-12 20:56:29,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1594 transitions, 29088 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-12 20:56:29,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:29,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2021-08-12 20:56:29,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:39,363 INFO L129 PetriNetUnfolder]: 10598/37470 cut-off events. [2021-08-12 20:56:39,364 INFO L130 PetriNetUnfolder]: For 46617/56090 co-relation queries the response was YES. [2021-08-12 20:56:39,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134939 conditions, 37470 events. 10598/37470 cut-off events. For 46617/56090 co-relation queries the response was YES. Maximal size of possible extension queue 2790. Compared 570113 event pairs, 1299 based on Foata normal form. 25/35614 useless extension candidates. Maximal degree in co-relation 134833. Up to 9189 conditions per place. [2021-08-12 20:56:39,738 INFO L132 encePairwiseOnDemand]: 113/124 looper letters, 29 selfloop transitions, 20 changer transitions 364/1178 dead transitions. [2021-08-12 20:56:39,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1178 transitions, 20182 flow [2021-08-12 20:56:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-12 20:56:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-12 20:56:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1141 transitions. [2021-08-12 20:56:39,742 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9201612903225806 [2021-08-12 20:56:39,742 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1141 transitions. [2021-08-12 20:56:39,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1141 transitions. [2021-08-12 20:56:39,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:39,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1141 transitions. [2021-08-12 20:56:39,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 114.1) internal successors, (1141), 10 states have internal predecessors, (1141), 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-12 20:56:39,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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-12 20:56:39,746 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 124.0) internal successors, (1364), 11 states have internal predecessors, (1364), 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-12 20:56:39,746 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 114 predicate places. [2021-08-12 20:56:39,746 INFO L482 AbstractCegarLoop]: Abstraction has has 245 places, 1178 transitions, 20182 flow [2021-08-12 20:56:39,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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-12 20:56:39,746 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:39,746 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, 1, 1, 1] [2021-08-12 20:56:39,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-12 20:56:39,746 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 860856055, now seen corresponding path program 1 times [2021-08-12 20:56:39,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:39,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354885141] [2021-08-12 20:56:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:39,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:39,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:39,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:39,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:39,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:39,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:39,818 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:56:39,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:56:39,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:39,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:39,836 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:56:39,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:39,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:39,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:39,843 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-12 20:56:39,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:39,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354885141] [2021-08-12 20:56:39,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354885141] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:39,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:39,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:56:39,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395927479] [2021-08-12 20:56:39,843 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:56:39,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:39,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:56:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:56:39,844 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2021-08-12 20:56:39,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1178 transitions, 20182 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-12 20:56:39,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:39,845 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2021-08-12 20:56:39,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:43,189 INFO L129 PetriNetUnfolder]: 4293/13905 cut-off events. [2021-08-12 20:56:43,189 INFO L130 PetriNetUnfolder]: For 13659/28693 co-relation queries the response was YES. [2021-08-12 20:56:43,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50535 conditions, 13905 events. 4293/13905 cut-off events. For 13659/28693 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 172528 event pairs, 194 based on Foata normal form. 589/13516 useless extension candidates. Maximal degree in co-relation 50426. Up to 2892 conditions per place. [2021-08-12 20:56:43,291 INFO L132 encePairwiseOnDemand]: 113/124 looper letters, 52 selfloop transitions, 54 changer transitions 510/871 dead transitions. [2021-08-12 20:56:43,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 871 transitions, 13326 flow [2021-08-12 20:56:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-12 20:56:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-12 20:56:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1485 transitions. [2021-08-12 20:56:43,293 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9212158808933002 [2021-08-12 20:56:43,293 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1485 transitions. [2021-08-12 20:56:43,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1485 transitions. [2021-08-12 20:56:43,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:43,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1485 transitions. [2021-08-12 20:56:43,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.23076923076923) internal successors, (1485), 13 states have internal predecessors, (1485), 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-12 20:56:43,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 124.0) internal successors, (1736), 14 states have internal predecessors, (1736), 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-12 20:56:43,297 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 124.0) internal successors, (1736), 14 states have internal predecessors, (1736), 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-12 20:56:43,297 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 126 predicate places. [2021-08-12 20:56:43,297 INFO L482 AbstractCegarLoop]: Abstraction has has 257 places, 871 transitions, 13326 flow [2021-08-12 20:56:43,298 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 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-12 20:56:43,298 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:43,298 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, 1, 1, 1, 1, 1] [2021-08-12 20:56:43,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-12 20:56:43,298 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1349647190, now seen corresponding path program 1 times [2021-08-12 20:56:43,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:43,299 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974170978] [2021-08-12 20:56:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:43,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:43,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:43,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:43,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:43,337 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:43,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:43,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:43,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:43,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:43,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:43,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:43,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:43,362 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-12 20:56:43,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:43,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974170978] [2021-08-12 20:56:43,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974170978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:43,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:43,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-12 20:56:43,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917190511] [2021-08-12 20:56:43,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-12 20:56:43,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-12 20:56:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-12 20:56:43,364 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 124 [2021-08-12 20:56:43,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 871 transitions, 13326 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-12 20:56:43,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:43,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 124 [2021-08-12 20:56:43,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:47,398 INFO L129 PetriNetUnfolder]: 7234/25658 cut-off events. [2021-08-12 20:56:47,399 INFO L130 PetriNetUnfolder]: For 39149/51964 co-relation queries the response was YES. [2021-08-12 20:56:47,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97874 conditions, 25658 events. 7234/25658 cut-off events. For 39149/51964 co-relation queries the response was YES. Maximal size of possible extension queue 1649. Compared 363275 event pairs, 289 based on Foata normal form. 40/24077 useless extension candidates. Maximal degree in co-relation 97762. Up to 5579 conditions per place. [2021-08-12 20:56:47,578 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 153 selfloop transitions, 36 changer transitions 1150/1587 dead transitions. [2021-08-12 20:56:47,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1587 transitions, 30094 flow [2021-08-12 20:56:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-12 20:56:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-12 20:56:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1029 transitions. [2021-08-12 20:56:47,581 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9220430107526881 [2021-08-12 20:56:47,581 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1029 transitions. [2021-08-12 20:56:47,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1029 transitions. [2021-08-12 20:56:47,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:47,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1029 transitions. [2021-08-12 20:56:47,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.33333333333333) internal successors, (1029), 9 states have internal predecessors, (1029), 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-12 20:56:47,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:47,583 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 124.0) internal successors, (1240), 10 states have internal predecessors, (1240), 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-12 20:56:47,584 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 134 predicate places. [2021-08-12 20:56:47,584 INFO L482 AbstractCegarLoop]: Abstraction has has 265 places, 1587 transitions, 30094 flow [2021-08-12 20:56:47,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 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-12 20:56:47,584 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:47,584 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, 1, 1, 1, 1, 1] [2021-08-12 20:56:47,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-12 20:56:47,584 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1818792658, now seen corresponding path program 1 times [2021-08-12 20:56:47,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:47,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483165721] [2021-08-12 20:56:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:47,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:47,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:47,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:47,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:47,631 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:56:47,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:56:47,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:47,648 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:56:47,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:47,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:47,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:47,655 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-12 20:56:47,655 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:47,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483165721] [2021-08-12 20:56:47,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483165721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:47,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:47,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-12 20:56:47,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007689762] [2021-08-12 20:56:47,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-12 20:56:47,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:47,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-12 20:56:47,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-12 20:56:47,657 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2021-08-12 20:56:47,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 1587 transitions, 30094 flow. Second operand has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 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-12 20:56:47,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:47,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2021-08-12 20:56:47,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:51,192 INFO L129 PetriNetUnfolder]: 4189/10251 cut-off events. [2021-08-12 20:56:51,192 INFO L130 PetriNetUnfolder]: For 7176/40924 co-relation queries the response was YES. [2021-08-12 20:56:51,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38163 conditions, 10251 events. 4189/10251 cut-off events. For 7176/40924 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 107763 event pairs, 0 based on Foata normal form. 1159/10215 useless extension candidates. Maximal degree in co-relation 38048. Up to 3222 conditions per place. [2021-08-12 20:56:51,249 INFO L132 encePairwiseOnDemand]: 113/124 looper letters, 33 selfloop transitions, 106 changer transitions 342/621 dead transitions. [2021-08-12 20:56:51,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 621 transitions, 9022 flow [2021-08-12 20:56:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-12 20:56:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-12 20:56:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1829 transitions. [2021-08-12 20:56:51,251 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.921875 [2021-08-12 20:56:51,251 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1829 transitions. [2021-08-12 20:56:51,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1829 transitions. [2021-08-12 20:56:51,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:51,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1829 transitions. [2021-08-12 20:56:51,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.3125) internal successors, (1829), 16 states have internal predecessors, (1829), 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-12 20:56:51,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 124.0) internal successors, (2108), 17 states have internal predecessors, (2108), 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-12 20:56:51,255 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 124.0) internal successors, (2108), 17 states have internal predecessors, (2108), 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-12 20:56:51,255 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 116 predicate places. [2021-08-12 20:56:51,255 INFO L482 AbstractCegarLoop]: Abstraction has has 247 places, 621 transitions, 9022 flow [2021-08-12 20:56:51,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 110.125) internal successors, (881), 8 states have internal predecessors, (881), 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-12 20:56:51,255 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:51,255 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:56:51,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-12 20:56:51,256 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash 957090291, now seen corresponding path program 1 times [2021-08-12 20:56:51,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:51,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720480765] [2021-08-12 20:56:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:51,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:51,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:51,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:51,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:51,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:51,306 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-12 20:56:51,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-12 20:56:51,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-12 20:56:51,329 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-12 20:56:51,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:51,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:51,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:51,338 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-12 20:56:51,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:51,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720480765] [2021-08-12 20:56:51,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720480765] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:51,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:51,339 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-12 20:56:51,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313829005] [2021-08-12 20:56:51,339 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-12 20:56:51,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-12 20:56:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-12 20:56:51,340 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 124 [2021-08-12 20:56:51,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 621 transitions, 9022 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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-12 20:56:51,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:51,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 124 [2021-08-12 20:56:51,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:52,737 INFO L129 PetriNetUnfolder]: 3896/7977 cut-off events. [2021-08-12 20:56:52,737 INFO L130 PetriNetUnfolder]: For 4515/47095 co-relation queries the response was YES. [2021-08-12 20:56:52,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34187 conditions, 7977 events. 3896/7977 cut-off events. For 4515/47095 co-relation queries the response was YES. Maximal size of possible extension queue 1288. Compared 78977 event pairs, 0 based on Foata normal form. 1314/8152 useless extension candidates. Maximal degree in co-relation 34069. Up to 3053 conditions per place. [2021-08-12 20:56:52,789 INFO L132 encePairwiseOnDemand]: 113/124 looper letters, 28 selfloop transitions, 111 changer transitions 121/368 dead transitions. [2021-08-12 20:56:52,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 368 transitions, 3650 flow [2021-08-12 20:56:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-12 20:56:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-12 20:56:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2153 transitions. [2021-08-12 20:56:52,791 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9138370118845501 [2021-08-12 20:56:52,791 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2153 transitions. [2021-08-12 20:56:52,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2153 transitions. [2021-08-12 20:56:52,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:52,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2153 transitions. [2021-08-12 20:56:52,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 113.3157894736842) internal successors, (2153), 19 states have internal predecessors, (2153), 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-12 20:56:52,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 124.0) internal successors, (2480), 20 states have internal predecessors, (2480), 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-12 20:56:52,795 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 124.0) internal successors, (2480), 20 states have internal predecessors, (2480), 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-12 20:56:52,795 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 104 predicate places. [2021-08-12 20:56:52,795 INFO L482 AbstractCegarLoop]: Abstraction has has 235 places, 368 transitions, 3650 flow [2021-08-12 20:56:52,796 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 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-12 20:56:52,796 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:52,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:56:52,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-12 20:56:52,796 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:52,796 INFO L82 PathProgramCache]: Analyzing trace with hash -347198809, now seen corresponding path program 1 times [2021-08-12 20:56:52,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:52,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259760672] [2021-08-12 20:56:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-12 20:56:52,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:52,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:52,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-12 20:56:52,841 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-12 20:56:52,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-12 20:56:52,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:52,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-12 20:56:52,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-12 20:56:52,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-12 20:56:52,870 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-12 20:56:52,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-12 20:56:52,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259760672] [2021-08-12 20:56:52,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259760672] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-12 20:56:52,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-12 20:56:52,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-12 20:56:52,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532060037] [2021-08-12 20:56:52,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-12 20:56:52,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-12 20:56:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-12 20:56:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-12 20:56:52,871 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 124 [2021-08-12 20:56:52,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 368 transitions, 3650 flow. Second operand has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 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-12 20:56:52,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-12 20:56:52,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 124 [2021-08-12 20:56:52,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-12 20:56:54,483 INFO L129 PetriNetUnfolder]: 7617/16022 cut-off events. [2021-08-12 20:56:54,483 INFO L130 PetriNetUnfolder]: For 9046/38488 co-relation queries the response was YES. [2021-08-12 20:56:54,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67087 conditions, 16022 events. 7617/16022 cut-off events. For 9046/38488 co-relation queries the response was YES. Maximal size of possible extension queue 2514. Compared 181442 event pairs, 0 based on Foata normal form. 29/14001 useless extension candidates. Maximal degree in co-relation 66965. Up to 5969 conditions per place. [2021-08-12 20:56:54,554 INFO L132 encePairwiseOnDemand]: 118/124 looper letters, 9 selfloop transitions, 1 changer transitions 190/409 dead transitions. [2021-08-12 20:56:54,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 409 transitions, 4722 flow [2021-08-12 20:56:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-12 20:56:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-08-12 20:56:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 788 transitions. [2021-08-12 20:56:54,555 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9078341013824884 [2021-08-12 20:56:54,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 788 transitions. [2021-08-12 20:56:54,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 788 transitions. [2021-08-12 20:56:54,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-12 20:56:54,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 788 transitions. [2021-08-12 20:56:54,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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-12 20:56:54,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 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-12 20:56:54,557 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 124.0) internal successors, (992), 8 states have internal predecessors, (992), 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-12 20:56:54,557 INFO L348 CegarLoopForPetriNet]: 131 programPoint places, 110 predicate places. [2021-08-12 20:56:54,557 INFO L482 AbstractCegarLoop]: Abstraction has has 241 places, 409 transitions, 4722 flow [2021-08-12 20:56:54,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 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-12 20:56:54,558 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-12 20:56:54,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-12 20:56:54,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-12 20:56:54,558 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-12 20:56:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-12 20:56:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -661376403, now seen corresponding path program 2 times [2021-08-12 20:56:54,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-12 20:56:54,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730458457] [2021-08-12 20:56:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-12 20:56:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:56:54,579 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:56:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-12 20:56:54,601 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-12 20:56:54,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-12 20:56:54,628 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-12 20:56:54,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-12 20:56:54,630 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-12 20:56:54,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.08 08:56:54 BasicIcfg [2021-08-12 20:56:54,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-12 20:56:54,744 INFO L168 Benchmark]: Toolchain (without parser) took 50393.06 ms. Allocated memory was 176.2 MB in the beginning and 5.1 GB in the end (delta: 4.9 GB). Free memory was 140.0 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,744 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 176.2 MB. Free memory was 158.1 MB in the beginning and 157.9 MB in the end (delta: 131.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-12 20:56:54,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.67 ms. Allocated memory is still 176.2 MB. Free memory was 139.9 MB in the beginning and 134.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.01 ms. Allocated memory is still 176.2 MB. Free memory was 134.0 MB in the beginning and 130.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,745 INFO L168 Benchmark]: Boogie Preprocessor took 35.60 ms. Allocated memory is still 176.2 MB. Free memory was 130.9 MB in the beginning and 128.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,745 INFO L168 Benchmark]: RCFGBuilder took 1460.99 ms. Allocated memory was 176.2 MB in the beginning and 220.2 MB in the end (delta: 44.0 MB). Free memory was 128.8 MB in the beginning and 142.1 MB in the end (delta: -13.3 MB). Peak memory consumption was 72.7 MB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,746 INFO L168 Benchmark]: TraceAbstraction took 48427.23 ms. Allocated memory was 220.2 MB in the beginning and 5.1 GB in the end (delta: 4.9 GB). Free memory was 141.5 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 8.0 GB. [2021-08-12 20:56:54,746 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.15 ms. Allocated memory is still 176.2 MB. Free memory was 158.1 MB in the beginning and 157.9 MB in the end (delta: 131.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 398.67 ms. Allocated memory is still 176.2 MB. Free memory was 139.9 MB in the beginning and 134.0 MB in the end (delta: 5.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.01 ms. Allocated memory is still 176.2 MB. Free memory was 134.0 MB in the beginning and 130.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.60 ms. Allocated memory is still 176.2 MB. Free memory was 130.9 MB in the beginning and 128.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1460.99 ms. Allocated memory was 176.2 MB in the beginning and 220.2 MB in the end (delta: 44.0 MB). Free memory was 128.8 MB in the beginning and 142.1 MB in the end (delta: -13.3 MB). Peak memory consumption was 72.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 48427.23 ms. Allocated memory was 220.2 MB in the beginning and 5.1 GB in the end (delta: 4.9 GB). Free memory was 141.5 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L714] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L723] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L724] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L725] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L726] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L727] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L728] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L729] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L730] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L731] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L732] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L733] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L734] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L735] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L736] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L737] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L738] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L739] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L740] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 pthread_t t1533; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1534; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1535; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1536; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0: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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 48241.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 45391.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 57.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 189 SDtfs, 710 SDslu, 719 SDs, 0 SdLazy, 1276 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1008.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2418.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30094occurred in iteration=13, InterpolantAutomatonStates: 191, 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: 45.7ms SsaConstructionTime, 462.5ms SatisfiabilityAnalysisTime, 2047.0ms InterpolantComputationTime, 1433 NumberOfCodeBlocks, 1433 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 5878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...