/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:44:33,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:44:33,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:44:33,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:44:33,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:44:33,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:44:33,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:44:33,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:44:33,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:44:33,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:44:33,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:44:33,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:44:33,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:44:33,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:44:33,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:44:33,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:44:33,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:44:33,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:44:33,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:44:33,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:44:33,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:44:33,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:44:33,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:44:33,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:44:33,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:44:33,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:44:33,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:44:33,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:44:33,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:44:33,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:44:33,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:44:33,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:44:33,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:44:33,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:44:33,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:44:33,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:44:33,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:44:33,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:44:33,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:44:33,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:44:33,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:44:33,836 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-RepeatedVariableLbe.epf [2021-03-25 04:44:33,861 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:44:33,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:44:33,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:44:33,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:44:33,865 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:44:33,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:44:33,865 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:44:33,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:44:33,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:44:33,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:44:33,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:44:33,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:44:33,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:44:33,867 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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-25 04:44:34,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:44:34,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:44:34,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:44:34,157 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:44:34,157 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:44:34,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2021-03-25 04:44:34,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c231c5593/e321092402c741189fec662abb897236/FLAG02da0504e [2021-03-25 04:44:34,660 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:44:34,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2021-03-25 04:44:34,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c231c5593/e321092402c741189fec662abb897236/FLAG02da0504e [2021-03-25 04:44:34,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c231c5593/e321092402c741189fec662abb897236 [2021-03-25 04:44:34,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:44:34,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:44:34,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:44:34,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:44:35,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:44:35,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:44:34" (1/1) ... [2021-03-25 04:44:35,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3bfd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35, skipping insertion in model container [2021-03-25 04:44:35,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:44:34" (1/1) ... [2021-03-25 04:44:35,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:44:35,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:44:35,145 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_pso.opt.i[948,961] [2021-03-25 04:44:35,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:44:35,256 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:44:35,263 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_pso.opt.i[948,961] [2021-03-25 04:44:35,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:44:35,331 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:44:35,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35 WrapperNode [2021-03-25 04:44:35,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:44:35,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:44:35,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:44:35,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:44:35,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:44:35,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:44:35,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:44:35,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:44:35,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (1/1) ... [2021-03-25 04:44:35,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:44:35,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:44:35,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:44:35,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:44:35,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (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-25 04:44:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:44:35,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:44:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:44:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:44:35,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:44:35,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:44:35,441 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:44:36,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:44:36,759 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:44:36,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:44:36 BoogieIcfgContainer [2021-03-25 04:44:36,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:44:36,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:44:36,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:44:36,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:44:36,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:44:34" (1/3) ... [2021-03-25 04:44:36,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5333d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:44:36, skipping insertion in model container [2021-03-25 04:44:36,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:35" (2/3) ... [2021-03-25 04:44:36,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5333d596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:44:36, skipping insertion in model container [2021-03-25 04:44:36,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:44:36" (3/3) ... [2021-03-25 04:44:36,765 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2021-03-25 04:44:36,769 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:44:36,773 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:44:36,773 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:44:36,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,796 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,804 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:36,805 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:44:36,817 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 04:44:36,831 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:44:36,831 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:44:36,832 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:44:36,832 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:44:36,832 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:44:36,832 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:44:36,832 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:44:36,832 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:44:36,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 04:44:36,861 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 04:44:36,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:36,864 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-25 04:44:36,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 04:44:36,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:36,868 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:36,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:36,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:36,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:36,888 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 04:44:36,889 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:36,889 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-25 04:44:36,891 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 04:44:37,673 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:44:38,015 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:44:39,034 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-25 04:44:39,275 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 04:44:40,401 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 04:44:40,911 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 04:44:41,206 INFO L154 LiptonReduction]: Checked pairs total: 1861 [2021-03-25 04:44:41,206 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-25 04:44:41,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4341 [2021-03-25 04:44:41,216 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-25 04:44:41,217 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:41,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:41,217 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:41,217 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:41,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 511986455, now seen corresponding path program 1 times [2021-03-25 04:44:41,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:41,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8575199] [2021-03-25 04:44:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:41,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:41,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:41,425 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-25 04:44:41,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8575199] [2021-03-25 04:44:41,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:41,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:44:41,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971678600] [2021-03-25 04:44:41,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:44:41,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:44:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:44:41,442 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2021-03-25 04:44:41,445 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-25 04:44:41,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:41,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2021-03-25 04:44:41,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:41,497 INFO L129 PetriNetUnfolder]: 16/84 cut-off events. [2021-03-25 04:44:41,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:41,498 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-25 04:44:41,500 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 7 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-25 04:44:41,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 84 flow [2021-03-25 04:44:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:44:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:44:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-03-25 04:44:41,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8741258741258742 [2021-03-25 04:44:41,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-03-25 04:44:41,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-03-25 04:44:41,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:41,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-03-25 04:44:41,522 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-25 04:44:41,528 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-25 04:44:41,528 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-25 04:44:41,529 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 375 transitions. [2021-03-25 04:44:41,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 84 flow [2021-03-25 04:44:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:41,533 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:41,534 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-25 04:44:41,534 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-25 04:44:41,534 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:41,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:41,536 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:41,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:41,542 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:44:41,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:41,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:44:41,543 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 04:44:41,928 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:44:42,231 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:44:42,819 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:44:43,372 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:44:43,890 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:44:44,007 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:44:44,527 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 04:44:44,785 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 04:44:45,955 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 277 DAG size of output: 276 [2021-03-25 04:44:46,539 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 04:44:46,786 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 04:44:46,902 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:44:47,164 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 04:44:47,313 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:44:47,316 INFO L154 LiptonReduction]: Checked pairs total: 748 [2021-03-25 04:44:47,316 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 04:44:47,316 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5782 [2021-03-25 04:44:47,316 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-25 04:44:47,317 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-25 04:44:47,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:47,317 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:47,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:44:47,317 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1652750832, now seen corresponding path program 1 times [2021-03-25 04:44:47,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:47,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256122645] [2021-03-25 04:44:47,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:47,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:47,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:47,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:47,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:47,422 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:44:47,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:44:47,425 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-25 04:44:47,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256122645] [2021-03-25 04:44:47,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:47,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:47,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956466827] [2021-03-25 04:44:47,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:47,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:47,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 153 [2021-03-25 04:44:47,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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-25 04:44:47,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:47,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 153 [2021-03-25 04:44:47,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:47,456 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-25 04:44:47,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:47,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 21 events. 1/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2021-03-25 04:44:47,457 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 1 selfloop transitions, 2 changer transitions 4/20 dead transitions. [2021-03-25 04:44:47,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 60 flow [2021-03-25 04:44:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2021-03-25 04:44:47,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8457516339869281 [2021-03-25 04:44:47,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2021-03-25 04:44:47,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2021-03-25 04:44:47,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:47,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2021-03-25 04:44:47,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 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-25 04:44:47,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 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-25 04:44:47,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 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-25 04:44:47,472 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 647 transitions. [2021-03-25 04:44:47,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 60 flow [2021-03-25 04:44:47,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:47,473 INFO L241 Difference]: Finished difference. Result has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:47,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2021-03-25 04:44:47,474 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2021-03-25 04:44:47,474 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:47,474 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:47,474 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:47,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-03-25 04:44:47,477 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 04:44:47,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:47,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:44:47,477 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-25 04:44:47,605 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-25 04:44:47,606 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:44:47,606 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-03-25 04:44:47,606 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 04:44:47,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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-25 04:44:47,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:47,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:47,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:44:47,607 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 268361190, now seen corresponding path program 1 times [2021-03-25 04:44:47,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:47,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251502131] [2021-03-25 04:44:47,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:47,764 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-03-25 04:44:47,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:44:47,779 INFO L142 QuantifierPusher]: treesize reduction 13, result has 80.3 percent of original size [2021-03-25 04:44:47,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 04:44:47,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:47,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:47,798 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-25 04:44:47,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251502131] [2021-03-25 04:44:47,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:47,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:44:47,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729316771] [2021-03-25 04:44:47,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:47,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:47,800 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 154 [2021-03-25 04:44:47,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-25 04:44:47,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:47,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 154 [2021-03-25 04:44:47,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:47,858 INFO L129 PetriNetUnfolder]: 21/61 cut-off events. [2021-03-25 04:44:47,859 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 04:44:47,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 61 events. 21/61 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 183 event pairs, 13 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 121. Up to 40 conditions per place. [2021-03-25 04:44:47,859 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 8 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2021-03-25 04:44:47,859 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 83 flow [2021-03-25 04:44:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:44:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:44:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2021-03-25 04:44:47,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7564935064935064 [2021-03-25 04:44:47,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2021-03-25 04:44:47,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2021-03-25 04:44:47,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:47,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2021-03-25 04:44:47,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 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-25 04:44:47,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 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-25 04:44:47,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 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-25 04:44:47,871 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 466 transitions. [2021-03-25 04:44:47,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 83 flow [2021-03-25 04:44:47,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:47,871 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:47,872 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-03-25 04:44:47,872 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2021-03-25 04:44:47,872 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:47,872 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:47,872 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:47,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:47,877 INFO L129 PetriNetUnfolder]: 3/25 cut-off events. [2021-03-25 04:44:47,877 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-03-25 04:44:47,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 3/25 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 45. Up to 8 conditions per place. [2021-03-25 04:44:47,878 INFO L142 LiptonReduction]: Number of co-enabled transitions 104 [2021-03-25 04:44:47,879 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-25 04:44:47,879 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:47,879 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 04:44:47,880 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:47,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-25 04:44:47,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:47,880 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:47,880 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:44:47,880 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 874280525, now seen corresponding path program 1 times [2021-03-25 04:44:47,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:47,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56266735] [2021-03-25 04:44:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:47,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:47,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:47,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:44:48,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:48,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:48,036 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-25 04:44:48,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56266735] [2021-03-25 04:44:48,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:48,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:44:48,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641297651] [2021-03-25 04:44:48,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:44:48,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:44:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:44:48,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 154 [2021-03-25 04:44:48,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 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-25 04:44:48,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:48,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 154 [2021-03-25 04:44:48,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:48,116 INFO L129 PetriNetUnfolder]: 24/63 cut-off events. [2021-03-25 04:44:48,116 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2021-03-25 04:44:48,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 63 events. 24/63 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 189 event pairs, 4 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 158. Up to 40 conditions per place. [2021-03-25 04:44:48,116 INFO L132 encePairwiseOnDemand]: 147/154 looper letters, 9 selfloop transitions, 9 changer transitions 0/26 dead transitions. [2021-03-25 04:44:48,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 126 flow [2021-03-25 04:44:48,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2021-03-25 04:44:48,118 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7480519480519481 [2021-03-25 04:44:48,118 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2021-03-25 04:44:48,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2021-03-25 04:44:48,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:48,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2021-03-25 04:44:48,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-25 04:44:48,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 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-25 04:44:48,121 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 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-25 04:44:48,121 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 71 flow. Second operand 5 states and 576 transitions. [2021-03-25 04:44:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 126 flow [2021-03-25 04:44:48,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 126 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:44:48,122 INFO L241 Difference]: Finished difference. Result has 31 places, 24 transitions, 116 flow [2021-03-25 04:44:48,122 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2021-03-25 04:44:48,122 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2021-03-25 04:44:48,123 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:48,123 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 116 flow [2021-03-25 04:44:48,123 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 116 flow [2021-03-25 04:44:48,123 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 116 flow [2021-03-25 04:44:48,127 INFO L129 PetriNetUnfolder]: 10/40 cut-off events. [2021-03-25 04:44:48,127 INFO L130 PetriNetUnfolder]: For 22/27 co-relation queries the response was YES. [2021-03-25 04:44:48,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 40 events. 10/40 cut-off events. For 22/27 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 2 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 98. Up to 16 conditions per place. [2021-03-25 04:44:48,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 04:44:48,130 INFO L154 LiptonReduction]: Checked pairs total: 128 [2021-03-25 04:44:48,130 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:48,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 04:44:48,131 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 116 flow [2021-03-25 04:44:48,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 112.83333333333333) internal successors, (677), 6 states have internal predecessors, (677), 0 states have call successors, (0), 0 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-25 04:44:48,132 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:48,132 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:48,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:44:48,132 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:48,132 INFO L82 PathProgramCache]: Analyzing trace with hash 874285175, now seen corresponding path program 2 times [2021-03-25 04:44:48,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:48,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607180639] [2021-03-25 04:44:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:48,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:48,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:48,224 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:44:48,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:44:48,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:48,250 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-25 04:44:48,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607180639] [2021-03-25 04:44:48,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:48,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:44:48,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864106790] [2021-03-25 04:44:48,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:44:48,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:44:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:44:48,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 154 [2021-03-25 04:44:48,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:44:48,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:48,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 154 [2021-03-25 04:44:48,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:48,311 INFO L129 PetriNetUnfolder]: 27/71 cut-off events. [2021-03-25 04:44:48,311 INFO L130 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2021-03-25 04:44:48,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 71 events. 27/71 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 224 event pairs, 5 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 230. Up to 44 conditions per place. [2021-03-25 04:44:48,312 INFO L132 encePairwiseOnDemand]: 147/154 looper letters, 12 selfloop transitions, 12 changer transitions 0/32 dead transitions. [2021-03-25 04:44:48,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 206 flow [2021-03-25 04:44:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2021-03-25 04:44:48,314 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2021-03-25 04:44:48,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2021-03-25 04:44:48,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2021-03-25 04:44:48,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:48,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2021-03-25 04:44:48,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 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-25 04:44:48,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 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-25 04:44:48,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 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-25 04:44:48,317 INFO L185 Difference]: Start difference. First operand has 31 places, 24 transitions, 116 flow. Second operand 5 states and 572 transitions. [2021-03-25 04:44:48,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 206 flow [2021-03-25 04:44:48,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 198 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 04:44:48,319 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 193 flow [2021-03-25 04:44:48,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-03-25 04:44:48,320 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-03-25 04:44:48,320 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:48,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 193 flow [2021-03-25 04:44:48,320 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 193 flow [2021-03-25 04:44:48,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 193 flow [2021-03-25 04:44:48,327 INFO L129 PetriNetUnfolder]: 21/65 cut-off events. [2021-03-25 04:44:48,327 INFO L130 PetriNetUnfolder]: For 94/98 co-relation queries the response was YES. [2021-03-25 04:44:48,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 65 events. 21/65 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 233 event pairs, 8 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 207. Up to 27 conditions per place. [2021-03-25 04:44:48,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-25 04:44:48,329 INFO L154 LiptonReduction]: Checked pairs total: 189 [2021-03-25 04:44:48,329 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:48,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 04:44:48,330 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 193 flow [2021-03-25 04:44:48,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:44:48,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:48,330 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:48,331 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:44:48,331 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1475477165, now seen corresponding path program 3 times [2021-03-25 04:44:48,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:48,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045336070] [2021-03-25 04:44:48,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:48,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:48,397 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 04:44:48,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 04:44:48,412 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:44:48,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:44:48,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:48,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:48,435 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-25 04:44:48,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045336070] [2021-03-25 04:44:48,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:48,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:44:48,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538783269] [2021-03-25 04:44:48,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:44:48,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:44:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:44:48,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 154 [2021-03-25 04:44:48,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 193 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:44:48,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:48,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 154 [2021-03-25 04:44:48,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:48,509 INFO L129 PetriNetUnfolder]: 27/77 cut-off events. [2021-03-25 04:44:48,509 INFO L130 PetriNetUnfolder]: For 154/157 co-relation queries the response was YES. [2021-03-25 04:44:48,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 77 events. 27/77 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 279 event pairs, 3 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 298. Up to 36 conditions per place. [2021-03-25 04:44:48,510 INFO L132 encePairwiseOnDemand]: 148/154 looper letters, 12 selfloop transitions, 16 changer transitions 0/36 dead transitions. [2021-03-25 04:44:48,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 281 flow [2021-03-25 04:44:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:44:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:44:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2021-03-25 04:44:48,512 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2021-03-25 04:44:48,512 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2021-03-25 04:44:48,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2021-03-25 04:44:48,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:48,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2021-03-25 04:44:48,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 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-25 04:44:48,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:48,515 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:48,515 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 193 flow. Second operand 6 states and 682 transitions. [2021-03-25 04:44:48,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 281 flow [2021-03-25 04:44:48,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 269 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:44:48,518 INFO L241 Difference]: Finished difference. Result has 42 places, 33 transitions, 246 flow [2021-03-25 04:44:48,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2021-03-25 04:44:48,519 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2021-03-25 04:44:48,519 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:48,519 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 246 flow [2021-03-25 04:44:48,519 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 246 flow [2021-03-25 04:44:48,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 246 flow [2021-03-25 04:44:48,526 INFO L129 PetriNetUnfolder]: 20/68 cut-off events. [2021-03-25 04:44:48,526 INFO L130 PetriNetUnfolder]: For 149/152 co-relation queries the response was YES. [2021-03-25 04:44:48,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 68 events. 20/68 cut-off events. For 149/152 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 248 event pairs, 2 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 249. Up to 27 conditions per place. [2021-03-25 04:44:48,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 04:44:48,677 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:44:49,018 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:44:49,120 INFO L154 LiptonReduction]: Checked pairs total: 454 [2021-03-25 04:44:49,121 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:44:49,121 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 602 [2021-03-25 04:44:49,121 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 252 flow [2021-03-25 04:44:49,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 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-25 04:44:49,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:49,122 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:49,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:44:49,122 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:49,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1443481631, now seen corresponding path program 1 times [2021-03-25 04:44:49,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:49,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581276451] [2021-03-25 04:44:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:49,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:49,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:49,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:49,156 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-25 04:44:49,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581276451] [2021-03-25 04:44:49,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:49,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:49,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130837123] [2021-03-25 04:44:49,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:49,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:49,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:49,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:49,158 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2021-03-25 04:44:49,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:49,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:49,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2021-03-25 04:44:49,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:49,180 INFO L129 PetriNetUnfolder]: 16/68 cut-off events. [2021-03-25 04:44:49,180 INFO L130 PetriNetUnfolder]: For 141/153 co-relation queries the response was YES. [2021-03-25 04:44:49,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 68 events. 16/68 cut-off events. For 141/153 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 249 event pairs, 3 based on Foata normal form. 19/85 useless extension candidates. Maximal degree in co-relation 233. Up to 25 conditions per place. [2021-03-25 04:44:49,181 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 4 selfloop transitions, 6 changer transitions 2/32 dead transitions. [2021-03-25 04:44:49,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 226 flow [2021-03-25 04:44:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2021-03-25 04:44:49,182 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8567741935483871 [2021-03-25 04:44:49,182 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2021-03-25 04:44:49,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2021-03-25 04:44:49,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:49,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2021-03-25 04:44:49,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-25 04:44:49,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-25 04:44:49,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-25 04:44:49,219 INFO L185 Difference]: Start difference. First operand has 42 places, 33 transitions, 252 flow. Second operand 5 states and 664 transitions. [2021-03-25 04:44:49,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 226 flow [2021-03-25 04:44:49,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 192 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-03-25 04:44:49,220 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 195 flow [2021-03-25 04:44:49,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2021-03-25 04:44:49,220 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-03-25 04:44:49,220 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:49,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 195 flow [2021-03-25 04:44:49,221 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 195 flow [2021-03-25 04:44:49,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 195 flow [2021-03-25 04:44:49,226 INFO L129 PetriNetUnfolder]: 11/59 cut-off events. [2021-03-25 04:44:49,226 INFO L130 PetriNetUnfolder]: For 101/106 co-relation queries the response was YES. [2021-03-25 04:44:49,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 59 events. 11/59 cut-off events. For 101/106 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 212 event pairs, 1 based on Foata normal form. 3/62 useless extension candidates. Maximal degree in co-relation 204. Up to 20 conditions per place. [2021-03-25 04:44:49,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-25 04:44:49,228 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-25 04:44:49,228 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:49,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:44:49,231 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 195 flow [2021-03-25 04:44:49,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:49,231 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:49,231 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:49,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:44:49,231 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:49,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1798004884, now seen corresponding path program 1 times [2021-03-25 04:44:49,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:49,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697435107] [2021-03-25 04:44:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:49,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:49,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:49,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:49,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:49,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:49,288 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-25 04:44:49,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697435107] [2021-03-25 04:44:49,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:49,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:44:49,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529345375] [2021-03-25 04:44:49,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:44:49,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:44:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:44:49,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 155 [2021-03-25 04:44:49,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 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-25 04:44:49,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:49,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 155 [2021-03-25 04:44:49,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:49,327 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-03-25 04:44:49,327 INFO L130 PetriNetUnfolder]: For 132/165 co-relation queries the response was YES. [2021-03-25 04:44:49,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 47 events. 7/47 cut-off events. For 132/165 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 155 event pairs, 0 based on Foata normal form. 28/75 useless extension candidates. Maximal degree in co-relation 163. Up to 13 conditions per place. [2021-03-25 04:44:49,328 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 2 selfloop transitions, 9 changer transitions 2/33 dead transitions. [2021-03-25 04:44:49,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 33 transitions, 233 flow [2021-03-25 04:44:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:44:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:44:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2021-03-25 04:44:49,330 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8525345622119815 [2021-03-25 04:44:49,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2021-03-25 04:44:49,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2021-03-25 04:44:49,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:49,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2021-03-25 04:44:49,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 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-25 04:44:49,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:49,333 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:49,333 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 195 flow. Second operand 7 states and 925 transitions. [2021-03-25 04:44:49,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 33 transitions, 233 flow [2021-03-25 04:44:49,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 33 transitions, 221 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 04:44:49,335 INFO L241 Difference]: Finished difference. Result has 51 places, 31 transitions, 219 flow [2021-03-25 04:44:49,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2021-03-25 04:44:49,335 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2021-03-25 04:44:49,335 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:49,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 31 transitions, 219 flow [2021-03-25 04:44:49,336 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 31 transitions, 219 flow [2021-03-25 04:44:49,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 31 transitions, 219 flow [2021-03-25 04:44:49,343 INFO L129 PetriNetUnfolder]: 6/45 cut-off events. [2021-03-25 04:44:49,343 INFO L130 PetriNetUnfolder]: For 108/113 co-relation queries the response was YES. [2021-03-25 04:44:49,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 45 events. 6/45 cut-off events. For 108/113 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 158. Up to 13 conditions per place. [2021-03-25 04:44:49,343 INFO L142 LiptonReduction]: Number of co-enabled transitions 108 [2021-03-25 04:44:49,599 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:44:49,717 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:44:50,314 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-25 04:44:50,528 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 04:44:51,840 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 346 DAG size of output: 267 [2021-03-25 04:44:52,323 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 04:44:52,327 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-25 04:44:52,327 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:44:52,327 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2992 [2021-03-25 04:44:52,327 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 199 flow [2021-03-25 04:44:52,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 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-25 04:44:52,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:52,328 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:52,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:44:52,328 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1988906290, now seen corresponding path program 1 times [2021-03-25 04:44:52,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:52,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931247288] [2021-03-25 04:44:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:52,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:52,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:52,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:52,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:52,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:52,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:52,366 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-25 04:44:52,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931247288] [2021-03-25 04:44:52,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:52,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:52,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132378750] [2021-03-25 04:44:52,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:52,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:52,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:52,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:52,367 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 157 [2021-03-25 04:44:52,368 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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-25 04:44:52,368 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:52,368 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 157 [2021-03-25 04:44:52,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:52,384 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2021-03-25 04:44:52,384 INFO L130 PetriNetUnfolder]: For 183/185 co-relation queries the response was YES. [2021-03-25 04:44:52,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 48 events. 9/48 cut-off events. For 183/185 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 3/51 useless extension candidates. Maximal degree in co-relation 177. Up to 14 conditions per place. [2021-03-25 04:44:52,385 INFO L132 encePairwiseOnDemand]: 154/157 looper letters, 3 selfloop transitions, 1 changer transitions 7/26 dead transitions. [2021-03-25 04:44:52,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 26 transitions, 193 flow [2021-03-25 04:44:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:44:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:44:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2021-03-25 04:44:52,386 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8248407643312102 [2021-03-25 04:44:52,386 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2021-03-25 04:44:52,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2021-03-25 04:44:52,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:52,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2021-03-25 04:44:52,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-25 04:44:52,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-25 04:44:52,388 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-25 04:44:52,388 INFO L185 Difference]: Start difference. First operand has 48 places, 27 transitions, 199 flow. Second operand 4 states and 518 transitions. [2021-03-25 04:44:52,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 26 transitions, 193 flow [2021-03-25 04:44:52,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 168 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-03-25 04:44:52,389 INFO L241 Difference]: Finished difference. Result has 41 places, 19 transitions, 117 flow [2021-03-25 04:44:52,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=41, PETRI_TRANSITIONS=19} [2021-03-25 04:44:52,389 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-03-25 04:44:52,389 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:52,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 19 transitions, 117 flow [2021-03-25 04:44:52,390 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 19 transitions, 117 flow [2021-03-25 04:44:52,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 19 transitions, 117 flow [2021-03-25 04:44:52,394 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-03-25 04:44:52,394 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-03-25 04:44:52,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 26 events. 3/26 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 81. Up to 7 conditions per place. [2021-03-25 04:44:52,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-25 04:44:52,556 INFO L154 LiptonReduction]: Checked pairs total: 19 [2021-03-25 04:44:52,556 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:44:52,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 167 [2021-03-25 04:44:52,556 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 17 transitions, 116 flow [2021-03-25 04:44:52,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 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-25 04:44:52,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:52,557 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:52,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:44:52,557 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:52,557 INFO L82 PathProgramCache]: Analyzing trace with hash -327074663, now seen corresponding path program 1 times [2021-03-25 04:44:52,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:52,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676491541] [2021-03-25 04:44:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:44:52,581 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:44:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:44:52,609 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:44:52,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:44:52,640 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:44:52,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:44:52,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:44:52 BasicIcfg [2021-03-25 04:44:52,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:44:52,696 INFO L168 Benchmark]: Toolchain (without parser) took 17708.37 ms. Allocated memory was 392.2 MB in the beginning and 788.5 MB in the end (delta: 396.4 MB). Free memory was 355.1 MB in the beginning and 462.1 MB in the end (delta: -107.0 MB). Peak memory consumption was 292.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,696 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 392.2 MB. Free memory was 373.0 MB in the beginning and 373.0 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:44:52,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.91 ms. Allocated memory is still 392.2 MB. Free memory was 354.8 MB in the beginning and 350.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.17 ms. Allocated memory is still 392.2 MB. Free memory was 350.9 MB in the beginning and 348.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,697 INFO L168 Benchmark]: Boogie Preprocessor took 18.19 ms. Allocated memory is still 392.2 MB. Free memory was 348.8 MB in the beginning and 346.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,697 INFO L168 Benchmark]: RCFGBuilder took 1377.17 ms. Allocated memory is still 392.2 MB. Free memory was 346.7 MB in the beginning and 308.4 MB in the end (delta: 38.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,697 INFO L168 Benchmark]: TraceAbstraction took 15934.51 ms. Allocated memory was 392.2 MB in the beginning and 788.5 MB in the end (delta: 396.4 MB). Free memory was 308.4 MB in the beginning and 462.1 MB in the end (delta: -153.6 MB). Peak memory consumption was 243.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:52,698 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.46 ms. Allocated memory is still 392.2 MB. Free memory was 373.0 MB in the beginning and 373.0 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 341.91 ms. Allocated memory is still 392.2 MB. Free memory was 354.8 MB in the beginning and 350.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.17 ms. Allocated memory is still 392.2 MB. Free memory was 350.9 MB in the beginning and 348.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 18.19 ms. Allocated memory is still 392.2 MB. Free memory was 348.8 MB in the beginning and 346.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1377.17 ms. Allocated memory is still 392.2 MB. Free memory was 346.7 MB in the beginning and 308.4 MB in the end (delta: 38.3 MB). Peak memory consumption was 146.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15934.51 ms. Allocated memory was 392.2 MB in the beginning and 788.5 MB in the end (delta: 396.4 MB). Free memory was 308.4 MB in the beginning and 462.1 MB in the end (delta: -153.6 MB). Peak memory consumption was 243.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4330.4ms, 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: 835, positive: 771, positive conditional: 0, positive unconditional: 771, 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: 500, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 500, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 835, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 500, unknown conditional: 0, unknown unconditional: 500] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5780.1ms, 34 PlacesBefore, 25 PlacesAfterwards, 27 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 240, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.6ms, 28 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 77, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8ms, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 47, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4ms, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 128 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 69, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 67, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 67, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 601.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 454 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 234, positive: 191, positive conditional: 0, positive unconditional: 191, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 234, positive: 187, positive conditional: 0, positive unconditional: 187, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 60, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2991.0ms, 51 PlacesBefore, 48 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 164, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 164, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.1ms, 41 PlacesBefore, 35 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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; [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; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [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 t1095; [L803] FCALL, FORK 0 pthread_create(&t1095, ((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 t1096; [L805] FCALL, FORK 0 pthread_create(&t1096, ((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 [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] [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 [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 [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: 4.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15812.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 582.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4380.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 14 SDslu, 11 SDs, 0 SdLazy, 186 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 165.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 199.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 44, 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: 35.7ms SsaConstructionTime, 342.8ms SatisfiabilityAnalysisTime, 539.2ms InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...