/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 21:10:36,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 21:10:36,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 21:10:36,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 21:10:36,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 21:10:36,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 21:10:36,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 21:10:36,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 21:10:36,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 21:10:36,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 21:10:36,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 21:10:36,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 21:10:36,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 21:10:36,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 21:10:36,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 21:10:37,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 21:10:37,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 21:10:37,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 21:10:37,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 21:10:37,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 21:10:37,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 21:10:37,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 21:10:37,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 21:10:37,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 21:10:37,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 21:10:37,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 21:10:37,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 21:10:37,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 21:10:37,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 21:10:37,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 21:10:37,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 21:10:37,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 21:10:37,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 21:10:37,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 21:10:37,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 21:10:37,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 21:10:37,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 21:10:37,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 21:10:37,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 21:10:37,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 21:10:37,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 21:10:37,026 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-SemanticLbe.epf [2021-06-10 21:10:37,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 21:10:37,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 21:10:37,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 21:10:37,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 21:10:37,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 21:10:37,056 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 21:10:37,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:10:37,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 21:10:37,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 21:10:37,058 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 21:10:37,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 21:10:37,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 21:10:37,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 21:10:37,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 21:10:37,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 21:10:37,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 21:10:37,313 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 21:10:37,314 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 21:10:37,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2021-06-10 21:10:37,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7d515c0/bcbb8c349b9444ecbe5827c9ffece5fc/FLAGd8fdec850 [2021-06-10 21:10:37,812 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 21:10:37,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2021-06-10 21:10:37,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7d515c0/bcbb8c349b9444ecbe5827c9ffece5fc/FLAGd8fdec850 [2021-06-10 21:10:38,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7d515c0/bcbb8c349b9444ecbe5827c9ffece5fc [2021-06-10 21:10:38,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 21:10:38,171 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 21:10:38,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 21:10:38,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 21:10:38,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 21:10:38,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ea5324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38, skipping insertion in model container [2021-06-10 21:10:38,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 21:10:38,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 21:10:38,344 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i[952,965] [2021-06-10 21:10:38,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:10:38,461 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 21:10:38,468 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i[952,965] [2021-06-10 21:10:38,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:10:38,539 INFO L208 MainTranslator]: Completed translation [2021-06-10 21:10:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38 WrapperNode [2021-06-10 21:10:38,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 21:10:38,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 21:10:38,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 21:10:38,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 21:10:38,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 21:10:38,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 21:10:38,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 21:10:38,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 21:10:38,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... [2021-06-10 21:10:38,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 21:10:38,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 21:10:38,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 21:10:38,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 21:10:38,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:10:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 21:10:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 21:10:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 21:10:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 21:10:38,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 21:10:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 21:10:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 21:10:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 21:10:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 21:10:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 21:10:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 21:10:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 21:10:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 21:10:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 21:10:38,689 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 21:10:40,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 21:10:40,009 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 21:10:40,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:10:40 BoogieIcfgContainer [2021-06-10 21:10:40,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 21:10:40,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 21:10:40,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 21:10:40,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 21:10:40,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 09:10:38" (1/3) ... [2021-06-10 21:10:40,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbc716f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:10:40, skipping insertion in model container [2021-06-10 21:10:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:10:38" (2/3) ... [2021-06-10 21:10:40,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbc716f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:10:40, skipping insertion in model container [2021-06-10 21:10:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:10:40" (3/3) ... [2021-06-10 21:10:40,015 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2021-06-10 21:10:40,024 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 21:10:40,027 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 21:10:40,028 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 21:10:40,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,051 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,054 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,056 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,067 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,067 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:10:40,068 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 21:10:40,079 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 21:10:40,092 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 21:10:40,093 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 21:10:40,093 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 21:10:40,093 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 21:10:40,093 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 21:10:40,093 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 21:10:40,093 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 21:10:40,093 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 21:10:40,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-06-10 21:10:40,124 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-10 21:10:40,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:10:40,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-10 21:10:40,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-06-10 21:10:40,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-06-10 21:10:40,130 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 21:10:40,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-10 21:10:40,141 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-06-10 21:10:40,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-06-10 21:10:40,154 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-06-10 21:10:40,154 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:10:40,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-10 21:10:40,156 INFO L151 LiptonReduction]: Number of co-enabled transitions 1694 [2021-06-10 21:10:40,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:40,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:40,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:40,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:40,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:40,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:40,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:41,043 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-06-10 21:10:41,341 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-06-10 21:10:42,604 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-06-10 21:10:43,194 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-10 21:10:43,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:43,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:43,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:43,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:43,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:43,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:43,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,876 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:43,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:43,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:43,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:43,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:43,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,124 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 21:10:44,124 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:10:44,145 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,260 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 21:10:44,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:44,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:44,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:45,046 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 21:10:45,414 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2021-06-10 21:10:45,565 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-10 21:10:45,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:45,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:10:45,584 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:45,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,585 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-10 21:10:45,586 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:10:45,588 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,589 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-10 21:10:45,590 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:45,591 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-10 21:10:45,592 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-10 21:10:45,592 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:10:45,593 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,595 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-10 21:10:45,595 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-10 21:10:45,595 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:10:45,597 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,604 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-10 21:10:45,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:45,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:45,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:45,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:45,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:45,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:45,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:45,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:45,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:45,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:45,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:46,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:46,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:46,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:46,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:46,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:46,116 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 21:10:46,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:46,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:46,536 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-06-10 21:10:46,819 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-06-10 21:10:47,446 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-10 21:10:48,011 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-10 21:10:48,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:48,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:48,301 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-06-10 21:10:48,596 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-06-10 21:10:49,256 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-10 21:10:49,897 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-06-10 21:10:50,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:50,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:50,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 21:10:50,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:50,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 21:10:50,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 21:10:50,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 21:10:50,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 21:10:50,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:50,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:50,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:50,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:50,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:50,989 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-06-10 21:10:51,298 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-06-10 21:10:52,156 WARN L205 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-06-10 21:10:52,966 WARN L205 SmtUtils]: Spent 807.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-06-10 21:10:53,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:53,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:53,456 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-10 21:10:53,578 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-10 21:10:53,850 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-06-10 21:10:53,979 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-06-10 21:10:53,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:53,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:10:53,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:53,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:53,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:10:54,024 INFO L163 LiptonReduction]: Checked pairs total: 4996 [2021-06-10 21:10:54,024 INFO L165 LiptonReduction]: Total number of compositions: 89 [2021-06-10 21:10:54,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13896 [2021-06-10 21:10:54,039 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-10 21:10:54,040 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:10:54,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,041 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-10 21:10:54,041 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1067641, now seen corresponding path program 1 times [2021-06-10 21:10:54,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288501728] [2021-06-10 21:10:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288501728] [2021-06-10 21:10:54,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:10:54,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237521280] [2021-06-10 21:10:54,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:10:54,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:10:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:10:54,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 187 [2021-06-10 21:10:54,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 187 [2021-06-10 21:10:54,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:54,315 INFO L129 PetriNetUnfolder]: 69/145 cut-off events. [2021-06-10 21:10:54,315 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:10:54,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 145 events. 69/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 621 event pairs, 54 based on Foata normal form. 11/136 useless extension candidates. Maximal degree in co-relation 263. Up to 89 conditions per place. [2021-06-10 21:10:54,317 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 9 selfloop transitions, 2 changer transitions 3/30 dead transitions. [2021-06-10 21:10:54,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 95 flow [2021-06-10 21:10:54,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:10:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:10:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-06-10 21:10:54,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8324420677361853 [2021-06-10 21:10:54,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-06-10 21:10:54,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-06-10 21:10:54,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:54,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-06-10 21:10:54,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,340 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 67 flow. Second operand 3 states and 467 transitions. [2021-06-10 21:10:54,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 95 flow [2021-06-10 21:10:54,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 21:10:54,343 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2021-06-10 21:10:54,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-06-10 21:10:54,345 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-10 21:10:54,345 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2021-06-10 21:10:54,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,345 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,345 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:54,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 21:10:54,345 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 366642329, now seen corresponding path program 1 times [2021-06-10 21:10:54,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981680578] [2021-06-10 21:10:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981680578] [2021-06-10 21:10:54,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:10:54,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046733615] [2021-06-10 21:10:54,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:10:54,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:10:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:10:54,432 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 187 [2021-06-10 21:10:54,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 187 [2021-06-10 21:10:54,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:54,444 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-10 21:10:54,444 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:10:54,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 21:10:54,445 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2021-06-10 21:10:54,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 62 flow [2021-06-10 21:10:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:10:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:10:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-06-10 21:10:54,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8413547237076648 [2021-06-10 21:10:54,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-06-10 21:10:54,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-06-10 21:10:54,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:54,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-06-10 21:10:54,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,451 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 472 transitions. [2021-06-10 21:10:54,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 62 flow [2021-06-10 21:10:54,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:10:54,451 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 56 flow [2021-06-10 21:10:54,452 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-06-10 21:10:54,452 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-10 21:10:54,452 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 56 flow [2021-06-10 21:10:54,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,452 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,452 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:54,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 21:10:54,453 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1996361157, now seen corresponding path program 1 times [2021-06-10 21:10:54,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561401131] [2021-06-10 21:10:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561401131] [2021-06-10 21:10:54,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 21:10:54,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99278538] [2021-06-10 21:10:54,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:10:54,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:10:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:10:54,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 187 [2021-06-10 21:10:54,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 187 [2021-06-10 21:10:54,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:54,596 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-10 21:10:54,596 INFO L130 PetriNetUnfolder]: For 5/12 co-relation queries the response was YES. [2021-06-10 21:10:54,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 28 events. 0/28 cut-off events. For 5/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 2/30 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-10 21:10:54,596 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-06-10 21:10:54,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 71 flow [2021-06-10 21:10:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 21:10:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 21:10:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2021-06-10 21:10:54,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8114973262032086 [2021-06-10 21:10:54,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2021-06-10 21:10:54,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2021-06-10 21:10:54,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:54,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2021-06-10 21:10:54,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,603 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 56 flow. Second operand 4 states and 607 transitions. [2021-06-10 21:10:54,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 71 flow [2021-06-10 21:10:54,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:10:54,603 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 66 flow [2021-06-10 21:10:54,604 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-06-10 21:10:54,604 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2021-06-10 21:10:54,604 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 66 flow [2021-06-10 21:10:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:54,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 21:10:54,605 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 539438510, now seen corresponding path program 1 times [2021-06-10 21:10:54,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903152964] [2021-06-10 21:10:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903152964] [2021-06-10 21:10:54,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:10:54,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340623839] [2021-06-10 21:10:54,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:10:54,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:10:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:10:54,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 187 [2021-06-10 21:10:54,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 187 [2021-06-10 21:10:54,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:54,694 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-10 21:10:54,694 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-06-10 21:10:54,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 21 events. 0/21 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-10 21:10:54,695 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-06-10 21:10:54,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 72 flow [2021-06-10 21:10:54,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:10:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:10:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-06-10 21:10:54,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8520499108734403 [2021-06-10 21:10:54,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-06-10 21:10:54,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-06-10 21:10:54,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:54,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-06-10 21:10:54,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,700 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 66 flow. Second operand 3 states and 478 transitions. [2021-06-10 21:10:54,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 72 flow [2021-06-10 21:10:54,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 60 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-10 21:10:54,701 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 62 flow [2021-06-10 21:10:54,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-06-10 21:10:54,701 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2021-06-10 21:10:54,701 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 62 flow [2021-06-10 21:10:54,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,701 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:54,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 21:10:54,701 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1519712887, now seen corresponding path program 1 times [2021-06-10 21:10:54,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283695601] [2021-06-10 21:10:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283695601] [2021-06-10 21:10:54,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 21:10:54,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629248507] [2021-06-10 21:10:54,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:10:54,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:10:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:10:54,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 187 [2021-06-10 21:10:54,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 187 [2021-06-10 21:10:54,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:54,803 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-10 21:10:54,803 INFO L130 PetriNetUnfolder]: For 11/13 co-relation queries the response was YES. [2021-06-10 21:10:54,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 28 events. 0/28 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-06-10 21:10:54,804 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 1 selfloop transitions, 3 changer transitions 1/22 dead transitions. [2021-06-10 21:10:54,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 22 transitions, 77 flow [2021-06-10 21:10:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 21:10:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 21:10:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2021-06-10 21:10:54,810 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8328877005347594 [2021-06-10 21:10:54,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2021-06-10 21:10:54,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2021-06-10 21:10:54,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:54,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2021-06-10 21:10:54,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,813 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 62 flow. Second operand 4 states and 623 transitions. [2021-06-10 21:10:54,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 22 transitions, 77 flow [2021-06-10 21:10:54,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 22 transitions, 71 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:10:54,814 INFO L241 Difference]: Finished difference. Result has 36 places, 21 transitions, 72 flow [2021-06-10 21:10:54,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2021-06-10 21:10:54,814 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2021-06-10 21:10:54,814 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 72 flow [2021-06-10 21:10:54,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:54,815 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:54,815 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:54,815 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 21:10:54,815 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1290692323, now seen corresponding path program 1 times [2021-06-10 21:10:54,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:54,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470918319] [2021-06-10 21:10:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:54,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:54,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:10:54,899 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-10 21:10:54,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-10 21:10:54,921 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-10 21:10:54,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-10 21:10:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:54,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470918319] [2021-06-10 21:10:54,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:54,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:10:54,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803702618] [2021-06-10 21:10:54,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:10:54,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:10:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:10:54,943 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 187 [2021-06-10 21:10:54,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 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-06-10 21:10:54,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:54,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 187 [2021-06-10 21:10:54,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:55,073 INFO L129 PetriNetUnfolder]: 47/113 cut-off events. [2021-06-10 21:10:55,074 INFO L130 PetriNetUnfolder]: For 110/115 co-relation queries the response was YES. [2021-06-10 21:10:55,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 113 events. 47/113 cut-off events. For 110/115 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 377 event pairs, 25 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 249. Up to 80 conditions per place. [2021-06-10 21:10:55,075 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 8 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-06-10 21:10:55,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 108 flow [2021-06-10 21:10:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-10 21:10:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-10 21:10:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2021-06-10 21:10:55,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2021-06-10 21:10:55,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2021-06-10 21:10:55,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2021-06-10 21:10:55,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:55,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2021-06-10 21:10:55,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,080 INFO L185 Difference]: Start difference. First operand has 36 places, 21 transitions, 72 flow. Second operand 4 states and 550 transitions. [2021-06-10 21:10:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 108 flow [2021-06-10 21:10:55,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 92 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-06-10 21:10:55,081 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 84 flow [2021-06-10 21:10:55,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-06-10 21:10:55,081 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-06-10 21:10:55,082 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 84 flow [2021-06-10 21:10:55,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 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-06-10 21:10:55,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:55,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:55,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-10 21:10:55,082 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2130313465, now seen corresponding path program 1 times [2021-06-10 21:10:55,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:55,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645619354] [2021-06-10 21:10:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:55,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,124 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:10:55,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:55,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:55,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645619354] [2021-06-10 21:10:55,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:55,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:10:55,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099370509] [2021-06-10 21:10:55,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:10:55,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:10:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:10:55,133 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 187 [2021-06-10 21:10:55,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:55,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 187 [2021-06-10 21:10:55,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:55,172 INFO L129 PetriNetUnfolder]: 63/157 cut-off events. [2021-06-10 21:10:55,172 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-10 21:10:55,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 157 events. 63/157 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 685 event pairs, 29 based on Foata normal form. 14/160 useless extension candidates. Maximal degree in co-relation 324. Up to 81 conditions per place. [2021-06-10 21:10:55,174 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 8 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2021-06-10 21:10:55,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 136 flow [2021-06-10 21:10:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:10:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:10:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2021-06-10 21:10:55,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-06-10 21:10:55,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 748 transitions. [2021-06-10 21:10:55,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 748 transitions. [2021-06-10 21:10:55,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:55,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 748 transitions. [2021-06-10 21:10:55,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,179 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,179 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 84 flow. Second operand 5 states and 748 transitions. [2021-06-10 21:10:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 136 flow [2021-06-10 21:10:55,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:10:55,181 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 138 flow [2021-06-10 21:10:55,181 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-06-10 21:10:55,181 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-06-10 21:10:55,181 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 138 flow [2021-06-10 21:10:55,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:55,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:55,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-10 21:10:55,181 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:55,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1754422200, now seen corresponding path program 1 times [2021-06-10 21:10:55,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:55,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732081077] [2021-06-10 21:10:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:55,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,235 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:10:55,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:55,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:55,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732081077] [2021-06-10 21:10:55,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:55,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:10:55,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913228303] [2021-06-10 21:10:55,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:10:55,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:10:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:10:55,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 187 [2021-06-10 21:10:55,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:55,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 187 [2021-06-10 21:10:55,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:55,299 INFO L129 PetriNetUnfolder]: 35/114 cut-off events. [2021-06-10 21:10:55,299 INFO L130 PetriNetUnfolder]: For 124/193 co-relation queries the response was YES. [2021-06-10 21:10:55,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 114 events. 35/114 cut-off events. For 124/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 445 event pairs, 5 based on Foata normal form. 47/156 useless extension candidates. Maximal degree in co-relation 374. Up to 68 conditions per place. [2021-06-10 21:10:55,301 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 5 selfloop transitions, 15 changer transitions 3/41 dead transitions. [2021-06-10 21:10:55,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 41 transitions, 242 flow [2021-06-10 21:10:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:10:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:10:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1047 transitions. [2021-06-10 21:10:55,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7998472116119175 [2021-06-10 21:10:55,303 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1047 transitions. [2021-06-10 21:10:55,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1047 transitions. [2021-06-10 21:10:55,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:55,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1047 transitions. [2021-06-10 21:10:55,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.57142857142858) internal successors, (1047), 7 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,307 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 187.0) internal successors, (1496), 8 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,307 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 138 flow. Second operand 7 states and 1047 transitions. [2021-06-10 21:10:55,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 41 transitions, 242 flow [2021-06-10 21:10:55,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-10 21:10:55,309 INFO L241 Difference]: Finished difference. Result has 48 places, 38 transitions, 233 flow [2021-06-10 21:10:55,309 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2021-06-10 21:10:55,309 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2021-06-10 21:10:55,310 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 233 flow [2021-06-10 21:10:55,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:55,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:55,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-10 21:10:55,310 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1751761921, now seen corresponding path program 1 times [2021-06-10 21:10:55,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:55,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695110049] [2021-06-10 21:10:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:55,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:10:55,367 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:10:55,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:10:55,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:10:55,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:10:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:55,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695110049] [2021-06-10 21:10:55,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:55,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:10:55,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330874533] [2021-06-10 21:10:55,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:10:55,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:55,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:10:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:10:55,377 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 187 [2021-06-10 21:10:55,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 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-06-10 21:10:55,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:55,378 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 187 [2021-06-10 21:10:55,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:55,439 INFO L129 PetriNetUnfolder]: 24/91 cut-off events. [2021-06-10 21:10:55,439 INFO L130 PetriNetUnfolder]: For 294/375 co-relation queries the response was YES. [2021-06-10 21:10:55,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 91 events. 24/91 cut-off events. For 294/375 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 349 event pairs, 1 based on Foata normal form. 42/129 useless extension candidates. Maximal degree in co-relation 389. Up to 58 conditions per place. [2021-06-10 21:10:55,440 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 2 selfloop transitions, 19 changer transitions 3/42 dead transitions. [2021-06-10 21:10:55,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 42 transitions, 311 flow [2021-06-10 21:10:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 21:10:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 21:10:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1340 transitions. [2021-06-10 21:10:55,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7961972667855021 [2021-06-10 21:10:55,443 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1340 transitions. [2021-06-10 21:10:55,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1340 transitions. [2021-06-10 21:10:55,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:55,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1340 transitions. [2021-06-10 21:10:55,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.88888888888889) internal successors, (1340), 9 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,449 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,449 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 233 flow. Second operand 9 states and 1340 transitions. [2021-06-10 21:10:55,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 42 transitions, 311 flow [2021-06-10 21:10:55,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 270 flow, removed 15 selfloop flow, removed 3 redundant places. [2021-06-10 21:10:55,453 INFO L241 Difference]: Finished difference. Result has 56 places, 39 transitions, 253 flow [2021-06-10 21:10:55,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2021-06-10 21:10:55,454 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2021-06-10 21:10:55,454 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 253 flow [2021-06-10 21:10:55,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 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-06-10 21:10:55,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:55,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:55,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-10 21:10:55,454 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1350107809, now seen corresponding path program 1 times [2021-06-10 21:10:55,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:55,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721878127] [2021-06-10 21:10:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:10:55,529 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-10 21:10:55,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 21:10:55,550 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.1 percent of original size [2021-06-10 21:10:55,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-06-10 21:10:55,591 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-06-10 21:10:55,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-06-10 21:10:55,630 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-06-10 21:10:55,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-06-10 21:10:55,671 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-06-10 21:10:55,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-06-10 21:10:55,708 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-06-10 21:10:55,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-10 21:10:55,743 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.2 percent of original size [2021-06-10 21:10:55,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 21:10:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:10:55,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721878127] [2021-06-10 21:10:55,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:10:55,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 21:10:55,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056258067] [2021-06-10 21:10:55,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-10 21:10:55,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:10:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-10 21:10:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-10 21:10:55,768 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 187 [2021-06-10 21:10:55,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 131.88888888888889) internal successors, (1187), 9 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:10:55,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 187 [2021-06-10 21:10:55,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:10:55,882 INFO L129 PetriNetUnfolder]: 40/143 cut-off events. [2021-06-10 21:10:55,883 INFO L130 PetriNetUnfolder]: For 473/577 co-relation queries the response was YES. [2021-06-10 21:10:55,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 143 events. 40/143 cut-off events. For 473/577 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 724 event pairs, 0 based on Foata normal form. 18/152 useless extension candidates. Maximal degree in co-relation 553. Up to 45 conditions per place. [2021-06-10 21:10:55,884 INFO L132 encePairwiseOnDemand]: 182/187 looper letters, 9 selfloop transitions, 3 changer transitions 5/45 dead transitions. [2021-06-10 21:10:55,884 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 317 flow [2021-06-10 21:10:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:10:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:10:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2021-06-10 21:10:55,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.713903743315508 [2021-06-10 21:10:55,888 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2021-06-10 21:10:55,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2021-06-10 21:10:55,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:10:55,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2021-06-10 21:10:55,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,891 INFO L185 Difference]: Start difference. First operand has 56 places, 39 transitions, 253 flow. Second operand 6 states and 801 transitions. [2021-06-10 21:10:55,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 317 flow [2021-06-10 21:10:55,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 253 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-06-10 21:10:55,894 INFO L241 Difference]: Finished difference. Result has 54 places, 38 transitions, 200 flow [2021-06-10 21:10:55,894 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2021-06-10 21:10:55,894 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2021-06-10 21:10:55,894 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 200 flow [2021-06-10 21:10:55,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 131.88888888888889) internal successors, (1187), 9 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:10:55,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:10:55,894 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:10:55,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 21:10:55,895 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:10:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:10:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 441079851, now seen corresponding path program 2 times [2021-06-10 21:10:55,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:10:55,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147050606] [2021-06-10 21:10:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:10:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:10:55,952 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:10:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:10:55,992 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:10:56,026 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 21:10:56,026 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 21:10:56,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 21:10:56,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 09:10:56 BasicIcfg [2021-06-10 21:10:56,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 21:10:56,093 INFO L168 Benchmark]: Toolchain (without parser) took 17921.70 ms. Allocated memory was 396.4 MB in the beginning and 727.7 MB in the end (delta: 331.4 MB). Free memory was 358.5 MB in the beginning and 425.2 MB in the end (delta: -66.7 MB). Peak memory consumption was 268.6 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 396.4 MB. Free memory is still 376.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.43 ms. Allocated memory is still 396.4 MB. Free memory was 358.4 MB in the beginning and 354.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 396.4 MB. Free memory was 354.9 MB in the beginning and 351.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: Boogie Preprocessor took 21.90 ms. Allocated memory is still 396.4 MB. Free memory was 351.7 MB in the beginning and 349.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: RCFGBuilder took 1409.87 ms. Allocated memory is still 396.4 MB. Free memory was 349.6 MB in the beginning and 287.3 MB in the end (delta: 62.3 MB). Peak memory consumption was 139.9 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,093 INFO L168 Benchmark]: TraceAbstraction took 16080.99 ms. Allocated memory was 396.4 MB in the beginning and 727.7 MB in the end (delta: 331.4 MB). Free memory was 286.3 MB in the beginning and 425.2 MB in the end (delta: -139.0 MB). Peak memory consumption was 192.4 MB. Max. memory is 16.0 GB. [2021-06-10 21:10:56,094 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.12 ms. Allocated memory is still 396.4 MB. Free memory is still 376.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 358.43 ms. Allocated memory is still 396.4 MB. Free memory was 358.4 MB in the beginning and 354.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 37.24 ms. Allocated memory is still 396.4 MB. Free memory was 354.9 MB in the beginning and 351.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.90 ms. Allocated memory is still 396.4 MB. Free memory was 351.7 MB in the beginning and 349.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1409.87 ms. Allocated memory is still 396.4 MB. Free memory was 349.6 MB in the beginning and 287.3 MB in the end (delta: 62.3 MB). Peak memory consumption was 139.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16080.99 ms. Allocated memory was 396.4 MB in the beginning and 727.7 MB in the end (delta: 331.4 MB). Free memory was 286.3 MB in the beginning and 425.2 MB in the end (delta: -139.0 MB). Peak memory consumption was 192.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13883.4ms, 103 PlacesBefore, 37 PlacesAfterwards, 95 TransitionsBefore, 29 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 89 TotalNumberOfCompositions, 4996 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2383, positive: 2230, positive conditional: 0, positive unconditional: 2230, negative: 153, negative conditional: 0, negative unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1248, positive: 1199, positive conditional: 0, positive unconditional: 1199, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1248, positive: 1199, positive conditional: 0, positive unconditional: 1199, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1248, positive: 1176, positive conditional: 0, positive unconditional: 1176, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 674, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 625, negative conditional: 0, negative unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2383, positive: 1031, positive conditional: 0, positive unconditional: 1031, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 1248, unknown conditional: 0, unknown unconditional: 1248] , Statistics on independence cache: Total cache size (in pairs): 2343, Positive cache size: 2294, Positive conditional cache size: 0, Positive unconditional cache size: 2294, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L798] 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) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] 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) [L798] 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) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 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 [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 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 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] 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) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] 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) [L831] 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) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 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 [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 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 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 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) [L842] 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) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15936.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 674.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13942.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 16 SDslu, 15 SDs, 0 SdLazy, 190 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 207.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 430.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=9, InterpolantAutomatonStates: 48, 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: 33.2ms SsaConstructionTime, 361.6ms SatisfiabilityAnalysisTime, 713.0ms InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...