/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/mix041_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-24 19:39:42,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-24 19:39:42,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-24 19:39:42,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-24 19:39:42,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-24 19:39:42,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-24 19:39:42,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-24 19:39:42,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-24 19:39:42,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-24 19:39:42,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-24 19:39:42,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-24 19:39:42,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-24 19:39:42,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-24 19:39:42,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-24 19:39:42,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-24 19:39:42,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-24 19:39:42,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-24 19:39:42,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-24 19:39:42,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-24 19:39:42,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-24 19:39:42,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-24 19:39:42,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-24 19:39:42,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-24 19:39:42,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-24 19:39:42,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-24 19:39:42,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-24 19:39:42,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-24 19:39:42,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-24 19:39:42,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-24 19:39:42,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-24 19:39:42,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-24 19:39:42,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-24 19:39:42,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-24 19:39:42,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-24 19:39:42,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-24 19:39:42,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-24 19:39:42,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-24 19:39:42,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-24 19:39:42,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-24 19:39:42,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-24 19:39:42,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-24 19:39:42,881 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-03-24 19:39:42,904 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-24 19:39:42,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-24 19:39:42,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-24 19:39:42,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * Use SBE=true [2021-03-24 19:39:42,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-24 19:39:42,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-24 19:39:42,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-24 19:39:42,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-24 19:39:42,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-24 19:39:42,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-24 19:39:42,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-24 19:39:42,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 19:39:42,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-24 19:39:42,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-24 19:39:42,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-24 19:39:42,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-24 19:39:42,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-24 19:39:42,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-24 19:39:42,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-24 19:39:43,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-24 19:39:43,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-24 19:39:43,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-24 19:39:43,220 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-24 19:39:43,223 INFO L275 PluginConnector]: CDTParser initialized [2021-03-24 19:39:43,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2021-03-24 19:39:43,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9304bd0e7/b11a2641d4914b31beb956ae229642ac/FLAG8249b9a74 [2021-03-24 19:39:43,755 INFO L306 CDTParser]: Found 1 translation units. [2021-03-24 19:39:43,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.opt.i [2021-03-24 19:39:43,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9304bd0e7/b11a2641d4914b31beb956ae229642ac/FLAG8249b9a74 [2021-03-24 19:39:44,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9304bd0e7/b11a2641d4914b31beb956ae229642ac [2021-03-24 19:39:44,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-24 19:39:44,054 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-24 19:39:44,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-24 19:39:44,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-24 19:39:44,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-24 19:39:44,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5607b28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44, skipping insertion in model container [2021-03-24 19:39:44,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-24 19:39:44,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-24 19:39:44,259 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/mix041_tso.opt.i[948,961] [2021-03-24 19:39:44,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:39:44,402 INFO L203 MainTranslator]: Completed pre-run [2021-03-24 19:39:44,411 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/mix041_tso.opt.i[948,961] [2021-03-24 19:39:44,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-24 19:39:44,536 INFO L208 MainTranslator]: Completed translation [2021-03-24 19:39:44,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44 WrapperNode [2021-03-24 19:39:44,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-24 19:39:44,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-24 19:39:44,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-24 19:39:44,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-24 19:39:44,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-24 19:39:44,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-24 19:39:44,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-24 19:39:44,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-24 19:39:44,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... [2021-03-24 19:39:44,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-24 19:39:44,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-24 19:39:44,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-24 19:39:44,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-24 19:39:44,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-24 19:39:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-24 19:39:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-24 19:39:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-24 19:39:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-24 19:39:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-24 19:39:44,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-24 19:39:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-24 19:39:44,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-24 19:39:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-24 19:39:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-24 19:39:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-24 19:39:44,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-24 19:39:44,734 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-24 19:39:46,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-24 19:39:46,239 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-24 19:39:46,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:39:46 BoogieIcfgContainer [2021-03-24 19:39:46,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-24 19:39:46,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-24 19:39:46,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-24 19:39:46,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-24 19:39:46,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.03 07:39:44" (1/3) ... [2021-03-24 19:39:46,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2281f5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:39:46, skipping insertion in model container [2021-03-24 19:39:46,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.03 07:39:44" (2/3) ... [2021-03-24 19:39:46,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2281f5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.03 07:39:46, skipping insertion in model container [2021-03-24 19:39:46,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.03 07:39:46" (3/3) ... [2021-03-24 19:39:46,249 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt.i [2021-03-24 19:39:46,256 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-24 19:39:46,260 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-24 19:39:46,261 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-24 19:39:46,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,291 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,295 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,296 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,301 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-24 19:39:46,307 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-24 19:39:46,323 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-24 19:39:46,342 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-24 19:39:46,342 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-24 19:39:46,343 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-24 19:39:46,343 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-24 19:39:46,343 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-24 19:39:46,343 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-24 19:39:46,343 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-24 19:39:46,343 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-24 19:39:46,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-24 19:39:46,384 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-24 19:39:46,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:46,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-24 19:39:46,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-24 19:39:46,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-24 19:39:46,392 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-24 19:39:46,402 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-24 19:39:46,405 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-24 19:39:46,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-24 19:39:46,420 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-24 19:39:46,421 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:46,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-24 19:39:46,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-24 19:39:47,595 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-24 19:39:48,022 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-24 19:39:48,176 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-24 19:39:49,443 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-24 19:39:50,056 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-24 19:39:51,402 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-24 19:39:51,972 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-24 19:39:52,596 INFO L154 LiptonReduction]: Checked pairs total: 1861 [2021-03-24 19:39:52,597 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-24 19:39:52,599 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6208 [2021-03-24 19:39:52,606 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-24 19:39:52,607 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:52,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:52,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:52,608 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:52,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:52,612 INFO L82 PathProgramCache]: Analyzing trace with hash 511986455, now seen corresponding path program 1 times [2021-03-24 19:39:52,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:52,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548354620] [2021-03-24 19:39:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:52,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:52,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:52,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:52,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:52,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548354620] [2021-03-24 19:39:52,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:52,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-24 19:39:52,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175106613] [2021-03-24 19:39:52,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-24 19:39:52,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-24 19:39:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-24 19:39:52,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2021-03-24 19:39:52,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:52,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:52,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2021-03-24 19:39:52,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:52,910 INFO L129 PetriNetUnfolder]: 16/84 cut-off events. [2021-03-24 19:39:52,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:52,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 84 events. 16/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 6 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-24 19:39:52,913 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 7 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-24 19:39:52,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 84 flow [2021-03-24 19:39:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-24 19:39:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-24 19:39:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-03-24 19:39:52,930 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8741258741258742 [2021-03-24 19:39:52,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-03-24 19:39:52,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-03-24 19:39:52,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:52,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-03-24 19:39:52,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:52,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:52,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:52,955 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 375 transitions. [2021-03-24 19:39:52,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 84 flow [2021-03-24 19:39:52,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 19:39:52,959 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2021-03-24 19:39:52,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2021-03-24 19:39:52,961 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-24 19:39:52,961 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 62 flow [2021-03-24 19:39:52,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:52,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:52,962 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:52,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-24 19:39:52,962 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1652750832, now seen corresponding path program 1 times [2021-03-24 19:39:52,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:52,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598873694] [2021-03-24 19:39:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:53,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:53,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:53,146 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:53,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:53,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598873694] [2021-03-24 19:39:53,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:53,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-24 19:39:53,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351725126] [2021-03-24 19:39:53,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-24 19:39:53,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:53,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-24 19:39:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-24 19:39:53,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2021-03-24 19:39:53,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:53,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2021-03-24 19:39:53,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:53,198 INFO L129 PetriNetUnfolder]: 1/41 cut-off events. [2021-03-24 19:39:53,199 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-24 19:39:53,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 1/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 46. Up to 5 conditions per place. [2021-03-24 19:39:53,199 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 2 selfloop transitions, 2 changer transitions 8/31 dead transitions. [2021-03-24 19:39:53,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 88 flow [2021-03-24 19:39:53,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:39:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:39:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2021-03-24 19:39:53,202 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8755244755244755 [2021-03-24 19:39:53,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2021-03-24 19:39:53,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2021-03-24 19:39:53,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:53,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2021-03-24 19:39:53,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,208 INFO L185 Difference]: Start difference. First operand has 34 places, 27 transitions, 62 flow. Second operand 5 states and 626 transitions. [2021-03-24 19:39:53,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 88 flow [2021-03-24 19:39:53,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-24 19:39:53,209 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 62 flow [2021-03-24 19:39:53,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-24 19:39:53,210 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2021-03-24 19:39:53,210 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 62 flow [2021-03-24 19:39:53,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:53,210 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:53,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-24 19:39:53,211 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2096363264, now seen corresponding path program 1 times [2021-03-24 19:39:53,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:53,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23064621] [2021-03-24 19:39:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:53,336 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:53,338 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-03-24 19:39:53,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:53,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-24 19:39:53,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:39:53,381 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-24 19:39:53,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-24 19:39:53,411 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.8 percent of original size [2021-03-24 19:39:53,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-24 19:39:53,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-24 19:39:53,437 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:53,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:53,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23064621] [2021-03-24 19:39:53,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:53,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:39:53,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167029489] [2021-03-24 19:39:53,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:39:53,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:39:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:39:53,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 143 [2021-03-24 19:39:53,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:53,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 143 [2021-03-24 19:39:53,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:53,714 INFO L129 PetriNetUnfolder]: 99/212 cut-off events. [2021-03-24 19:39:53,714 INFO L130 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2021-03-24 19:39:53,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 212 events. 99/212 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 866 event pairs, 4 based on Foata normal form. 12/224 useless extension candidates. Maximal degree in co-relation 443. Up to 83 conditions per place. [2021-03-24 19:39:53,716 INFO L132 encePairwiseOnDemand]: 132/143 looper letters, 24 selfloop transitions, 12 changer transitions 16/62 dead transitions. [2021-03-24 19:39:53,717 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 254 flow [2021-03-24 19:39:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-24 19:39:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-24 19:39:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1101 transitions. [2021-03-24 19:39:53,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6999364272091545 [2021-03-24 19:39:53,721 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1101 transitions. [2021-03-24 19:39:53,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1101 transitions. [2021-03-24 19:39:53,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:53,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1101 transitions. [2021-03-24 19:39:53,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 143.0) internal successors, (1716), 12 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,728 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 143.0) internal successors, (1716), 12 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,728 INFO L185 Difference]: Start difference. First operand has 39 places, 23 transitions, 62 flow. Second operand 11 states and 1101 transitions. [2021-03-24 19:39:53,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 254 flow [2021-03-24 19:39:53,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 242 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-24 19:39:53,730 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 157 flow [2021-03-24 19:39:53,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-03-24 19:39:53,731 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2021-03-24 19:39:53,731 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 157 flow [2021-03-24 19:39:53,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,732 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:53,732 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:53,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-24 19:39:53,732 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash -422427767, now seen corresponding path program 1 times [2021-03-24 19:39:53,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:53,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478574506] [2021-03-24 19:39:53,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:53,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:53,786 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-03-24 19:39:53,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:53,790 INFO L142 QuantifierPusher]: treesize reduction 4, result has 63.6 percent of original size [2021-03-24 19:39:53,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:39:53,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-24 19:39:53,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-24 19:39:53,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-24 19:39:53,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-24 19:39:53,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:53,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-24 19:39:53,834 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:53,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:53,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478574506] [2021-03-24 19:39:53,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:53,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-24 19:39:53,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150654966] [2021-03-24 19:39:53,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 19:39:53,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 19:39:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-24 19:39:53,844 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 143 [2021-03-24 19:39:53,845 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 157 flow. Second operand has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:53,845 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:53,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 143 [2021-03-24 19:39:53,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:54,057 INFO L129 PetriNetUnfolder]: 98/210 cut-off events. [2021-03-24 19:39:54,058 INFO L130 PetriNetUnfolder]: For 556/568 co-relation queries the response was YES. [2021-03-24 19:39:54,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 210 events. 98/210 cut-off events. For 556/568 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 844 event pairs, 5 based on Foata normal form. 12/222 useless extension candidates. Maximal degree in co-relation 771. Up to 78 conditions per place. [2021-03-24 19:39:54,061 INFO L132 encePairwiseOnDemand]: 131/143 looper letters, 27 selfloop transitions, 17 changer transitions 9/63 dead transitions. [2021-03-24 19:39:54,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 432 flow [2021-03-24 19:39:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:39:54,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:39:54,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1009 transitions. [2021-03-24 19:39:54,064 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7055944055944056 [2021-03-24 19:39:54,064 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1009 transitions. [2021-03-24 19:39:54,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1009 transitions. [2021-03-24 19:39:54,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:54,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1009 transitions. [2021-03-24 19:39:54,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.9) internal successors, (1009), 10 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 143.0) internal successors, (1573), 11 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,070 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 143.0) internal successors, (1573), 11 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,070 INFO L185 Difference]: Start difference. First operand has 47 places, 32 transitions, 157 flow. Second operand 10 states and 1009 transitions. [2021-03-24 19:39:54,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 432 flow [2021-03-24 19:39:54,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 420 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-24 19:39:54,074 INFO L241 Difference]: Finished difference. Result has 53 places, 40 transitions, 250 flow [2021-03-24 19:39:54,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=250, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2021-03-24 19:39:54,074 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2021-03-24 19:39:54,074 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 250 flow [2021-03-24 19:39:54,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:54,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:54,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-24 19:39:54,075 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:54,076 INFO L82 PathProgramCache]: Analyzing trace with hash 145073171, now seen corresponding path program 2 times [2021-03-24 19:39:54,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:54,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324232282] [2021-03-24 19:39:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:54,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:54,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:54,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:39:54,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:39:54,148 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-24 19:39:54,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-24 19:39:54,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:39:54,181 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:54,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:54,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324232282] [2021-03-24 19:39:54,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:54,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:39:54,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335867221] [2021-03-24 19:39:54,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:39:54,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:54,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:39:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:39:54,189 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 143 [2021-03-24 19:39:54,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:54,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 143 [2021-03-24 19:39:54,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:54,310 INFO L129 PetriNetUnfolder]: 42/121 cut-off events. [2021-03-24 19:39:54,310 INFO L130 PetriNetUnfolder]: For 468/486 co-relation queries the response was YES. [2021-03-24 19:39:54,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 121 events. 42/121 cut-off events. For 468/486 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 455 event pairs, 9 based on Foata normal form. 12/131 useless extension candidates. Maximal degree in co-relation 524. Up to 65 conditions per place. [2021-03-24 19:39:54,311 INFO L132 encePairwiseOnDemand]: 134/143 looper letters, 13 selfloop transitions, 14 changer transitions 5/49 dead transitions. [2021-03-24 19:39:54,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 398 flow [2021-03-24 19:39:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-24 19:39:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-24 19:39:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2021-03-24 19:39:54,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7491258741258742 [2021-03-24 19:39:54,314 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2021-03-24 19:39:54,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2021-03-24 19:39:54,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:54,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2021-03-24 19:39:54,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 143.0) internal successors, (1287), 9 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,319 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 143.0) internal successors, (1287), 9 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,319 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 250 flow. Second operand 8 states and 857 transitions. [2021-03-24 19:39:54,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 398 flow [2021-03-24 19:39:54,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 372 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-03-24 19:39:54,323 INFO L241 Difference]: Finished difference. Result has 57 places, 42 transitions, 291 flow [2021-03-24 19:39:54,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=291, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2021-03-24 19:39:54,324 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-03-24 19:39:54,324 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 291 flow [2021-03-24 19:39:54,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,324 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:54,324 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:54,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-24 19:39:54,325 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash 163358989, now seen corresponding path program 3 times [2021-03-24 19:39:54,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:54,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210139879] [2021-03-24 19:39:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:54,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:54,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:54,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-24 19:39:54,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:39:54,408 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-24 19:39:54,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:39:54,420 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-24 19:39:54,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-24 19:39:54,432 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:54,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:54,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210139879] [2021-03-24 19:39:54,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:54,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-24 19:39:54,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408649600] [2021-03-24 19:39:54,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-24 19:39:54,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-24 19:39:54,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-24 19:39:54,445 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 143 [2021-03-24 19:39:54,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 291 flow. Second operand has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:54,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 143 [2021-03-24 19:39:54,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:54,614 INFO L129 PetriNetUnfolder]: 37/112 cut-off events. [2021-03-24 19:39:54,615 INFO L130 PetriNetUnfolder]: For 574/595 co-relation queries the response was YES. [2021-03-24 19:39:54,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 112 events. 37/112 cut-off events. For 574/595 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 413 event pairs, 6 based on Foata normal form. 18/129 useless extension candidates. Maximal degree in co-relation 503. Up to 48 conditions per place. [2021-03-24 19:39:54,629 INFO L132 encePairwiseOnDemand]: 135/143 looper letters, 15 selfloop transitions, 16 changer transitions 5/53 dead transitions. [2021-03-24 19:39:54,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 485 flow [2021-03-24 19:39:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-24 19:39:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-24 19:39:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 962 transitions. [2021-03-24 19:39:54,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2021-03-24 19:39:54,633 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 962 transitions. [2021-03-24 19:39:54,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 962 transitions. [2021-03-24 19:39:54,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:54,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 962 transitions. [2021-03-24 19:39:54,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.88888888888889) internal successors, (962), 9 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,638 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 143.0) internal successors, (1430), 10 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,638 INFO L185 Difference]: Start difference. First operand has 57 places, 42 transitions, 291 flow. Second operand 9 states and 962 transitions. [2021-03-24 19:39:54,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 485 flow [2021-03-24 19:39:54,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 430 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-24 19:39:54,642 INFO L241 Difference]: Finished difference. Result has 61 places, 45 transitions, 343 flow [2021-03-24 19:39:54,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=343, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2021-03-24 19:39:54,643 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2021-03-24 19:39:54,643 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 343 flow [2021-03-24 19:39:54,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:54,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:54,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-24 19:39:54,645 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 87354591, now seen corresponding path program 1 times [2021-03-24 19:39:54,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:54,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141087395] [2021-03-24 19:39:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:54,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:54,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:54,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:39:54,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-24 19:39:54,777 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.7 percent of original size [2021-03-24 19:39:54,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-24 19:39:54,802 INFO L142 QuantifierPusher]: treesize reduction 29, result has 76.0 percent of original size [2021-03-24 19:39:54,807 INFO L147 QuantifierPusher]: treesize reduction 18, result has 80.4 percent of original size 74 [2021-03-24 19:39:54,859 INFO L142 QuantifierPusher]: treesize reduction 29, result has 75.2 percent of original size [2021-03-24 19:39:54,862 INFO L147 QuantifierPusher]: treesize reduction 18, result has 79.5 percent of original size 70 [2021-03-24 19:39:54,915 INFO L142 QuantifierPusher]: treesize reduction 40, result has 69.2 percent of original size [2021-03-24 19:39:54,918 INFO L147 QuantifierPusher]: treesize reduction 18, result has 80.0 percent of original size 72 [2021-03-24 19:39:54,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:54,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:54,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141087395] [2021-03-24 19:39:54,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:54,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-24 19:39:54,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506702279] [2021-03-24 19:39:54,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-24 19:39:54,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-24 19:39:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-24 19:39:54,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 143 [2021-03-24 19:39:54,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 343 flow. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:54,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:54,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 143 [2021-03-24 19:39:54,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:55,400 INFO L129 PetriNetUnfolder]: 166/344 cut-off events. [2021-03-24 19:39:55,400 INFO L130 PetriNetUnfolder]: For 2108/2182 co-relation queries the response was YES. [2021-03-24 19:39:55,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 344 events. 166/344 cut-off events. For 2108/2182 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1581 event pairs, 10 based on Foata normal form. 47/391 useless extension candidates. Maximal degree in co-relation 1514. Up to 123 conditions per place. [2021-03-24 19:39:55,403 INFO L132 encePairwiseOnDemand]: 131/143 looper letters, 40 selfloop transitions, 23 changer transitions 26/98 dead transitions. [2021-03-24 19:39:55,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 914 flow [2021-03-24 19:39:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-24 19:39:55,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-24 19:39:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1204 transitions. [2021-03-24 19:39:55,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6476600322754169 [2021-03-24 19:39:55,407 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1204 transitions. [2021-03-24 19:39:55,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1204 transitions. [2021-03-24 19:39:55,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:55,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1204 transitions. [2021-03-24 19:39:55,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.61538461538461) internal successors, (1204), 13 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 143.0) internal successors, (2002), 14 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,414 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 143.0) internal successors, (2002), 14 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,414 INFO L185 Difference]: Start difference. First operand has 61 places, 45 transitions, 343 flow. Second operand 13 states and 1204 transitions. [2021-03-24 19:39:55,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 914 flow [2021-03-24 19:39:55,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 813 flow, removed 43 selfloop flow, removed 5 redundant places. [2021-03-24 19:39:55,421 INFO L241 Difference]: Finished difference. Result has 74 places, 54 transitions, 456 flow [2021-03-24 19:39:55,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=456, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2021-03-24 19:39:55,421 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 38 predicate places. [2021-03-24 19:39:55,421 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 456 flow [2021-03-24 19:39:55,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:55,422 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:55,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-24 19:39:55,422 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash -858714527, now seen corresponding path program 2 times [2021-03-24 19:39:55,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:55,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542658378] [2021-03-24 19:39:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:55,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:55,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:55,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:39:55,489 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:39:55,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:39:55,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:55,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542658378] [2021-03-24 19:39:55,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:55,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-24 19:39:55,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769784150] [2021-03-24 19:39:55,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:39:55,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:39:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:39:55,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2021-03-24 19:39:55,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 456 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:55,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2021-03-24 19:39:55,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:55,576 INFO L129 PetriNetUnfolder]: 62/156 cut-off events. [2021-03-24 19:39:55,576 INFO L130 PetriNetUnfolder]: For 1247/1299 co-relation queries the response was YES. [2021-03-24 19:39:55,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 156 events. 62/156 cut-off events. For 1247/1299 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 627 event pairs, 8 based on Foata normal form. 53/200 useless extension candidates. Maximal degree in co-relation 720. Up to 51 conditions per place. [2021-03-24 19:39:55,578 INFO L132 encePairwiseOnDemand]: 137/143 looper letters, 5 selfloop transitions, 11 changer transitions 15/62 dead transitions. [2021-03-24 19:39:55,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 62 transitions, 551 flow [2021-03-24 19:39:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-24 19:39:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-24 19:39:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2021-03-24 19:39:55,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391608391608392 [2021-03-24 19:39:55,581 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2021-03-24 19:39:55,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2021-03-24 19:39:55,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:55,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2021-03-24 19:39:55,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,586 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,586 INFO L185 Difference]: Start difference. First operand has 74 places, 54 transitions, 456 flow. Second operand 7 states and 840 transitions. [2021-03-24 19:39:55,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 62 transitions, 551 flow [2021-03-24 19:39:55,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 481 flow, removed 15 selfloop flow, removed 11 redundant places. [2021-03-24 19:39:55,592 INFO L241 Difference]: Finished difference. Result has 68 places, 47 transitions, 372 flow [2021-03-24 19:39:55,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2021-03-24 19:39:55,592 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2021-03-24 19:39:55,592 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 372 flow [2021-03-24 19:39:55,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:55,593 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:55,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-24 19:39:55,593 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1801218982, now seen corresponding path program 1 times [2021-03-24 19:39:55,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:55,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112096382] [2021-03-24 19:39:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:55,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:55,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:55,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:55,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-24 19:39:55,664 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-24 19:39:55,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-24 19:39:55,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:55,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112096382] [2021-03-24 19:39:55,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:55,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-24 19:39:55,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168798922] [2021-03-24 19:39:55,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-24 19:39:55,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-24 19:39:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-24 19:39:55,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2021-03-24 19:39:55,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 372 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:55,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2021-03-24 19:39:55,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:55,771 INFO L129 PetriNetUnfolder]: 21/89 cut-off events. [2021-03-24 19:39:55,772 INFO L130 PetriNetUnfolder]: For 650/693 co-relation queries the response was YES. [2021-03-24 19:39:55,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 89 events. 21/89 cut-off events. For 650/693 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 321 event pairs, 1 based on Foata normal form. 50/135 useless extension candidates. Maximal degree in co-relation 372. Up to 26 conditions per place. [2021-03-24 19:39:55,773 INFO L132 encePairwiseOnDemand]: 137/143 looper letters, 3 selfloop transitions, 15 changer transitions 5/54 dead transitions. [2021-03-24 19:39:55,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 54 transitions, 464 flow [2021-03-24 19:39:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-24 19:39:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-24 19:39:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1191 transitions. [2021-03-24 19:39:55,776 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8328671328671329 [2021-03-24 19:39:55,776 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1191 transitions. [2021-03-24 19:39:55,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1191 transitions. [2021-03-24 19:39:55,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:55,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1191 transitions. [2021-03-24 19:39:55,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.1) internal successors, (1191), 10 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 143.0) internal successors, (1573), 11 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,782 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 143.0) internal successors, (1573), 11 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,782 INFO L185 Difference]: Start difference. First operand has 68 places, 47 transitions, 372 flow. Second operand 10 states and 1191 transitions. [2021-03-24 19:39:55,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 54 transitions, 464 flow [2021-03-24 19:39:55,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 54 transitions, 415 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-03-24 19:39:55,786 INFO L241 Difference]: Finished difference. Result has 77 places, 49 transitions, 399 flow [2021-03-24 19:39:55,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=399, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2021-03-24 19:39:55,786 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 41 predicate places. [2021-03-24 19:39:55,786 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 399 flow [2021-03-24 19:39:55,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:55,787 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:55,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-24 19:39:55,787 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:55,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:55,788 INFO L82 PathProgramCache]: Analyzing trace with hash -975435964, now seen corresponding path program 1 times [2021-03-24 19:39:55,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:55,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970899108] [2021-03-24 19:39:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-24 19:39:55,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-24 19:39:55,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:55,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-24 19:39:55,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-24 19:39:55,850 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-24 19:39:55,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-24 19:39:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-24 19:39:55,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970899108] [2021-03-24 19:39:55,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-24 19:39:55,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-24 19:39:55,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119008859] [2021-03-24 19:39:55,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-24 19:39:55,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-24 19:39:55,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-24 19:39:55,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-24 19:39:55,857 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2021-03-24 19:39:55,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-24 19:39:55,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2021-03-24 19:39:55,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-24 19:39:55,900 INFO L129 PetriNetUnfolder]: 25/127 cut-off events. [2021-03-24 19:39:55,900 INFO L130 PetriNetUnfolder]: For 858/875 co-relation queries the response was YES. [2021-03-24 19:39:55,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 127 events. 25/127 cut-off events. For 858/875 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 590 event pairs, 2 based on Foata normal form. 16/137 useless extension candidates. Maximal degree in co-relation 540. Up to 34 conditions per place. [2021-03-24 19:39:55,902 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 5 selfloop transitions, 1 changer transitions 15/51 dead transitions. [2021-03-24 19:39:55,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 51 transitions, 419 flow [2021-03-24 19:39:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-24 19:39:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-24 19:39:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2021-03-24 19:39:55,904 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2021-03-24 19:39:55,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2021-03-24 19:39:55,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2021-03-24 19:39:55,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-24 19:39:55,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2021-03-24 19:39:55,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,908 INFO L185 Difference]: Start difference. First operand has 77 places, 49 transitions, 399 flow. Second operand 5 states and 594 transitions. [2021-03-24 19:39:55,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 51 transitions, 419 flow [2021-03-24 19:39:55,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 51 transitions, 369 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-03-24 19:39:55,913 INFO L241 Difference]: Finished difference. Result has 73 places, 36 transitions, 236 flow [2021-03-24 19:39:55,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=73, PETRI_TRANSITIONS=36} [2021-03-24 19:39:55,914 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 37 predicate places. [2021-03-24 19:39:55,914 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 36 transitions, 236 flow [2021-03-24 19:39:55,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-24 19:39:55,914 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-24 19:39:55,914 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-24 19:39:55,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-24 19:39:55,915 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-24 19:39:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-24 19:39:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash 643085008, now seen corresponding path program 2 times [2021-03-24 19:39:55,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-24 19:39:55,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814688160] [2021-03-24 19:39:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-24 19:39:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:39:55,963 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:39:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-24 19:39:56,009 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-24 19:39:56,046 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-24 19:39:56,046 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-24 19:39:56,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-24 19:39:56,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.03 07:39:56 BasicIcfg [2021-03-24 19:39:56,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-24 19:39:56,125 INFO L168 Benchmark]: Toolchain (without parser) took 12069.01 ms. Allocated memory was 255.9 MB in the beginning and 557.8 MB in the end (delta: 302.0 MB). Free memory was 234.2 MB in the beginning and 226.3 MB in the end (delta: 7.9 MB). Peak memory consumption was 310.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,125 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-24 19:39:56,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 482.30 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.2 MB in the beginning and 318.5 MB in the end (delta: -84.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.08 ms. Allocated memory is still 358.6 MB. Free memory was 318.5 MB in the beginning and 315.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,127 INFO L168 Benchmark]: Boogie Preprocessor took 35.69 ms. Allocated memory is still 358.6 MB. Free memory was 315.7 MB in the beginning and 313.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,128 INFO L168 Benchmark]: RCFGBuilder took 1581.49 ms. Allocated memory is still 358.6 MB. Free memory was 313.6 MB in the beginning and 321.5 MB in the end (delta: -7.9 MB). Peak memory consumption was 61.6 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,131 INFO L168 Benchmark]: TraceAbstraction took 9878.55 ms. Allocated memory was 358.6 MB in the beginning and 557.8 MB in the end (delta: 199.2 MB). Free memory was 320.5 MB in the beginning and 226.3 MB in the end (delta: 94.2 MB). Peak memory consumption was 294.5 MB. Max. memory is 16.0 GB. [2021-03-24 19:39:56,134 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 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 482.30 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 234.2 MB in the beginning and 318.5 MB in the end (delta: -84.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 85.08 ms. Allocated memory is still 358.6 MB. Free memory was 318.5 MB in the beginning and 315.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 35.69 ms. Allocated memory is still 358.6 MB. Free memory was 315.7 MB in the beginning and 313.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1581.49 ms. Allocated memory is still 358.6 MB. Free memory was 313.6 MB in the beginning and 321.5 MB in the end (delta: -7.9 MB). Peak memory consumption was 61.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9878.55 ms. Allocated memory was 358.6 MB in the beginning and 557.8 MB in the end (delta: 199.2 MB). Free memory was 320.5 MB in the beginning and 226.3 MB in the end (delta: 94.2 MB). Peak memory consumption was 294.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6192.3ms, 87 PlacesBefore, 36 PlacesAfterwards, 82 TransitionsBefore, 30 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 59 TotalNumberOfCompositions, 1861 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 849, positive: 785, positive conditional: 0, positive unconditional: 785, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 656, positive: 622, positive conditional: 0, positive unconditional: 622, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 656, positive: 622, positive conditional: 0, positive unconditional: 622, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 656, positive: 620, positive conditional: 0, positive unconditional: 620, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 753, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 748, negative conditional: 0, negative unconditional: 748, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 849, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1103; [L803] FCALL, FORK 0 pthread_create(&t1103, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1104; [L805] FCALL, FORK 0 pthread_create(&t1104, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9708.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1747.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6260.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 54 SDtfs, 137 SDslu, 116 SDs, 0 SdLazy, 562 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 579.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 868.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=7, InterpolantAutomatonStates: 81, 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: 31.4ms SsaConstructionTime, 366.9ms SatisfiabilityAnalysisTime, 1015.0ms InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 1049 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...