/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:40:52,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:40:52,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:40:52,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:40:52,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:40:52,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:40:52,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:40:52,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:40:52,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:40:52,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:40:52,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:40:52,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:40:52,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:40:52,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:40:52,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:40:52,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:40:52,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:40:52,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:40:52,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:40:52,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:40:52,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:40:52,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:40:52,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:40:52,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:40:52,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:40:52,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:40:52,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:40:52,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:40:52,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:40:52,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:40:52,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:40:52,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:40:52,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:40:52,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:40:52,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:40:52,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:40:52,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:40:52,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:40:52,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:40:52,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:40:52,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:40:52,917 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-RepeatedSemanticLbe.epf [2021-03-25 14:40:52,956 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:40:52,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:40:52,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:40:52,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:40:52,961 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:40:52,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:40:52,961 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:40:52,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:40:52,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:40:52,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:40:52,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:40:52,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:40:52,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:40:52,962 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:40:52,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:40:52,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:40:52,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:40:52,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:40:52,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:40:52,964 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 14:40:53,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:40:53,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:40:53,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:40:53,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:40:53,288 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:40:53,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2021-03-25 14:40:53,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148d075f2/68a6f61409f14aed9b0f249b2ee57a7f/FLAGb339fc23a [2021-03-25 14:40:53,857 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:40:53,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt.i [2021-03-25 14:40:53,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148d075f2/68a6f61409f14aed9b0f249b2ee57a7f/FLAGb339fc23a [2021-03-25 14:40:54,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148d075f2/68a6f61409f14aed9b0f249b2ee57a7f [2021-03-25 14:40:54,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:40:54,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:40:54,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:54,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:40:54,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:40:54,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7daad7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54, skipping insertion in model container [2021-03-25 14:40:54,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:40:54,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:40:54,370 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/rfi001_power.opt.i[950,963] [2021-03-25 14:40:54,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:54,533 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:40:54,544 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/rfi001_power.opt.i[950,963] [2021-03-25 14:40:54,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:54,669 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:40:54,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54 WrapperNode [2021-03-25 14:40:54,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:54,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:54,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:40:54,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:40:54,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:54,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:40:54,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:40:54,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:40:54,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (1/1) ... [2021-03-25 14:40:54,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:40:54,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:40:54,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:40:54,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:40:54,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (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 14:40:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:40:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:40:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:40:54,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:40:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:40:54,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:40:54,868 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:40:54,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:40:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:40:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:40:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:40:54,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:40:54,871 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 14:40:56,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:40:56,307 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:40:56,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:56 BoogieIcfgContainer [2021-03-25 14:40:56,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:40:56,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:40:56,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:40:56,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:40:56,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:40:54" (1/3) ... [2021-03-25 14:40:56,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce4de37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:56, skipping insertion in model container [2021-03-25 14:40:56,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:54" (2/3) ... [2021-03-25 14:40:56,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce4de37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:56, skipping insertion in model container [2021-03-25 14:40:56,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:56" (3/3) ... [2021-03-25 14:40:56,315 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt.i [2021-03-25 14:40:56,320 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:40:56,324 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:40:56,325 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:40:56,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,347 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,352 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:56,362 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:40:56,378 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:40:56,394 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:40:56,395 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:40:56,395 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:40:56,395 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:40:56,395 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:40:56,395 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:40:56,395 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:40:56,395 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:40:56,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 14:40:56,430 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 14:40:56,430 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:56,433 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 14:40:56,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 14:40:56,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-25 14:40:56,438 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:56,448 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 14:40:56,451 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 14:40:56,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-25 14:40:56,466 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 14:40:56,466 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:56,466 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 52 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 14:40:56,468 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 14:40:57,700 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:40:58,094 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:40:58,206 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:40:59,566 WARN L205 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-25 14:41:00,114 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-25 14:41:01,421 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2021-03-25 14:41:01,988 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-25 14:41:02,358 INFO L154 LiptonReduction]: Checked pairs total: 1715 [2021-03-25 14:41:02,359 INFO L156 LiptonReduction]: Total number of compositions: 56 [2021-03-25 14:41:02,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5923 [2021-03-25 14:41:02,370 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 14:41:02,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:41:02,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:02,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:02,371 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1574192890, now seen corresponding path program 1 times [2021-03-25 14:41:02,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:02,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068652525] [2021-03-25 14:41:02,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:02,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:02,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:41:02,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:02,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:02,627 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 14:41:02,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068652525] [2021-03-25 14:41:02,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:02,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:41:02,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933975124] [2021-03-25 14:41:02,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:41:02,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:41:02,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:41:02,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 140 [2021-03-25 14:41:02,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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 14:41:02,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:02,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 140 [2021-03-25 14:41:02,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:02,718 INFO L129 PetriNetUnfolder]: 16/87 cut-off events. [2021-03-25 14:41:02,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:41:02,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 87 events. 16/87 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/86 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-25 14:41:02,721 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-25 14:41:02,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 90 flow [2021-03-25 14:41:02,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:41:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:41:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-03-25 14:41:02,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8785714285714286 [2021-03-25 14:41:02,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-03-25 14:41:02,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-03-25 14:41:02,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:02,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-03-25 14:41:02,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 14:41:02,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 14:41:02,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 14:41:02,761 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 369 transitions. [2021-03-25 14:41:02,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 90 flow [2021-03-25 14:41:02,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:41:02,764 INFO L241 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2021-03-25 14:41:02,766 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2021-03-25 14:41:02,766 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-03-25 14:41:02,767 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:02,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-25 14:41:02,768 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 68 flow [2021-03-25 14:41:02,768 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2021-03-25 14:41:02,774 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 14:41:02,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:41:02,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 30 events. 0/30 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/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:41:02,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 14:41:03,347 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:41:03,674 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:41:04,292 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:41:04,881 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:41:05,364 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:41:05,475 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:41:05,914 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 14:41:06,215 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 14:41:06,853 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 14:41:07,490 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 14:41:08,136 INFO L154 LiptonReduction]: Checked pairs total: 651 [2021-03-25 14:41:08,136 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-25 14:41:08,136 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5369 [2021-03-25 14:41:08,137 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-25 14:41:08,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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 14:41:08,138 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:08,138 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:08,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:41:08,138 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1071371314, now seen corresponding path program 1 times [2021-03-25 14:41:08,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:08,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124788526] [2021-03-25 14:41:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:08,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:08,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:41:08,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:08,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:08,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:08,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:41:08,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:08,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:41:08,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:08,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:41:08,380 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:41:08,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:41:08,385 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 14:41:08,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124788526] [2021-03-25 14:41:08,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:08,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:41:08,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613483409] [2021-03-25 14:41:08,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:41:08,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:08,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:41:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:41:08,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2021-03-25 14:41:08,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 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 14:41:08,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:08,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2021-03-25 14:41:08,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:08,568 INFO L129 PetriNetUnfolder]: 36/98 cut-off events. [2021-03-25 14:41:08,568 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-25 14:41:08,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 98 events. 36/98 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 374 event pairs, 16 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 177. Up to 45 conditions per place. [2021-03-25 14:41:08,571 INFO L132 encePairwiseOnDemand]: 146/153 looper letters, 8 selfloop transitions, 6 changer transitions 12/34 dead transitions. [2021-03-25 14:41:08,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 132 flow [2021-03-25 14:41:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:41:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:41:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2021-03-25 14:41:08,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7606209150326797 [2021-03-25 14:41:08,578 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2021-03-25 14:41:08,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2021-03-25 14:41:08,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:08,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2021-03-25 14:41:08,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 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 14:41:08,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 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 14:41:08,585 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 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 14:41:08,585 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 8 states and 931 transitions. [2021-03-25 14:41:08,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 132 flow [2021-03-25 14:41:08,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:41:08,586 INFO L241 Difference]: Finished difference. Result has 34 places, 20 transitions, 76 flow [2021-03-25 14:41:08,586 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2021-03-25 14:41:08,587 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2021-03-25 14:41:08,587 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:08,587 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 20 transitions, 76 flow [2021-03-25 14:41:08,587 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 20 transitions, 76 flow [2021-03-25 14:41:08,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 76 flow [2021-03-25 14:41:08,598 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-25 14:41:08,599 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2021-03-25 14:41:08,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 29 events. 3/29 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 51. Up to 8 conditions per place. [2021-03-25 14:41:08,599 INFO L142 LiptonReduction]: Number of co-enabled transitions 104 [2021-03-25 14:41:08,879 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 14:41:09,001 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 14:41:09,258 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 14:41:09,376 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 14:41:09,418 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-25 14:41:09,418 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:41:09,419 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 832 [2021-03-25 14:41:09,419 INFO L480 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 72 flow [2021-03-25 14:41:09,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 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 14:41:09,420 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:09,420 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:09,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:41:09,420 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1690963834, now seen corresponding path program 1 times [2021-03-25 14:41:09,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:09,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058967492] [2021-03-25 14:41:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:09,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:09,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:09,525 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 14:41:09,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058967492] [2021-03-25 14:41:09,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:09,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:41:09,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729666566] [2021-03-25 14:41:09,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:41:09,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:09,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:41:09,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:41:09,527 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 154 [2021-03-25 14:41:09,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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 14:41:09,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:09,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 154 [2021-03-25 14:41:09,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:09,544 INFO L129 PetriNetUnfolder]: 3/25 cut-off events. [2021-03-25 14:41:09,545 INFO L130 PetriNetUnfolder]: For 20/21 co-relation queries the response was YES. [2021-03-25 14:41:09,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 25 events. 3/25 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 1 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 51. Up to 8 conditions per place. [2021-03-25 14:41:09,545 INFO L132 encePairwiseOnDemand]: 151/154 looper letters, 1 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2021-03-25 14:41:09,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 19 transitions, 78 flow [2021-03-25 14:41:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:41:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:41:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2021-03-25 14:41:09,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8658008658008658 [2021-03-25 14:41:09,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2021-03-25 14:41:09,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2021-03-25 14:41:09,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:09,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2021-03-25 14:41:09,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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 14:41:09,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 14:41:09,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 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 14:41:09,550 INFO L185 Difference]: Start difference. First operand has 27 places, 19 transitions, 72 flow. Second operand 3 states and 400 transitions. [2021-03-25 14:41:09,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 19 transitions, 78 flow [2021-03-25 14:41:09,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 74 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:41:09,552 INFO L241 Difference]: Finished difference. Result has 28 places, 19 transitions, 76 flow [2021-03-25 14:41:09,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2021-03-25 14:41:09,552 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -11 predicate places. [2021-03-25 14:41:09,552 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:09,553 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 76 flow [2021-03-25 14:41:09,553 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 76 flow [2021-03-25 14:41:09,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 76 flow [2021-03-25 14:41:09,558 INFO L129 PetriNetUnfolder]: 2/26 cut-off events. [2021-03-25 14:41:09,558 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 14:41:09,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 26 events. 2/26 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 46. Up to 7 conditions per place. [2021-03-25 14:41:09,558 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-25 14:41:09,559 INFO L154 LiptonReduction]: Checked pairs total: 104 [2021-03-25 14:41:09,560 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:41:09,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:41:09,564 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 76 flow [2021-03-25 14:41:09,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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 14:41:09,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:09,565 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:09,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:41:09,565 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2122934408, now seen corresponding path program 1 times [2021-03-25 14:41:09,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:09,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075176661] [2021-03-25 14:41:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:09,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:09,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:41:09,730 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-03-25 14:41:09,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 14:41:09,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:09,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:41:09,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:09,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:41:09,781 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-03-25 14:41:09,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:41:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:41:09,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075176661] [2021-03-25 14:41:09,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:09,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:41:09,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658177227] [2021-03-25 14:41:09,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:41:09,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:41:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:41:09,785 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 154 [2021-03-25 14:41:09,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 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 14:41:09,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:09,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 154 [2021-03-25 14:41:09,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:10,060 INFO L129 PetriNetUnfolder]: 101/200 cut-off events. [2021-03-25 14:41:10,061 INFO L130 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2021-03-25 14:41:10,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 200 events. 101/200 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 783 event pairs, 6 based on Foata normal form. 15/215 useless extension candidates. Maximal degree in co-relation 513. Up to 112 conditions per place. [2021-03-25 14:41:10,069 INFO L132 encePairwiseOnDemand]: 144/154 looper letters, 17 selfloop transitions, 16 changer transitions 16/54 dead transitions. [2021-03-25 14:41:10,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 278 flow [2021-03-25 14:41:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:41:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:41:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 904 transitions. [2021-03-25 14:41:10,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6522366522366523 [2021-03-25 14:41:10,072 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 904 transitions. [2021-03-25 14:41:10,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 904 transitions. [2021-03-25 14:41:10,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:10,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 904 transitions. [2021-03-25 14:41:10,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.44444444444444) internal successors, (904), 9 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 14:41:10,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 14:41:10,078 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 154.0) internal successors, (1540), 10 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 14:41:10,078 INFO L185 Difference]: Start difference. First operand has 28 places, 19 transitions, 76 flow. Second operand 9 states and 904 transitions. [2021-03-25 14:41:10,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 278 flow [2021-03-25 14:41:10,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 268 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 14:41:10,082 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 190 flow [2021-03-25 14:41:10,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=190, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2021-03-25 14:41:10,083 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2021-03-25 14:41:10,083 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:10,083 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 190 flow [2021-03-25 14:41:10,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 190 flow [2021-03-25 14:41:10,084 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 190 flow [2021-03-25 14:41:10,102 INFO L129 PetriNetUnfolder]: 44/110 cut-off events. [2021-03-25 14:41:10,102 INFO L130 PetriNetUnfolder]: For 142/147 co-relation queries the response was YES. [2021-03-25 14:41:10,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 110 events. 44/110 cut-off events. For 142/147 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 457 event pairs, 7 based on Foata normal form. 2/106 useless extension candidates. Maximal degree in co-relation 345. Up to 39 conditions per place. [2021-03-25 14:41:10,104 INFO L142 LiptonReduction]: Number of co-enabled transitions 112 [2021-03-25 14:41:10,132 INFO L154 LiptonReduction]: Checked pairs total: 84 [2021-03-25 14:41:10,132 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:41:10,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-25 14:41:10,133 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 190 flow [2021-03-25 14:41:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 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 14:41:10,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:10,134 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:10,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:41:10,134 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:10,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1030991708, now seen corresponding path program 2 times [2021-03-25 14:41:10,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:10,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718022105] [2021-03-25 14:41:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:10,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:10,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:41:10,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:41:10,196 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 14:41:10,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718022105] [2021-03-25 14:41:10,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:10,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:41:10,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984792438] [2021-03-25 14:41:10,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:41:10,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:10,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:41:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:41:10,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-25 14:41:10,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 190 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 14:41:10,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:10,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-25 14:41:10,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:10,235 INFO L129 PetriNetUnfolder]: 32/96 cut-off events. [2021-03-25 14:41:10,236 INFO L130 PetriNetUnfolder]: For 194/197 co-relation queries the response was YES. [2021-03-25 14:41:10,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 96 events. 32/96 cut-off events. For 194/197 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 5 based on Foata normal form. 10/103 useless extension candidates. Maximal degree in co-relation 337. Up to 35 conditions per place. [2021-03-25 14:41:10,237 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 9 changer transitions 7/40 dead transitions. [2021-03-25 14:41:10,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 262 flow [2021-03-25 14:41:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:41:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:41:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2021-03-25 14:41:10,239 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8493506493506493 [2021-03-25 14:41:10,239 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2021-03-25 14:41:10,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2021-03-25 14:41:10,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:10,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2021-03-25 14:41:10,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 14:41:10,244 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 14:41:10,244 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 14:41:10,244 INFO L185 Difference]: Start difference. First operand has 37 places, 33 transitions, 190 flow. Second operand 5 states and 654 transitions. [2021-03-25 14:41:10,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 262 flow [2021-03-25 14:41:10,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 252 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 14:41:10,250 INFO L241 Difference]: Finished difference. Result has 41 places, 33 transitions, 219 flow [2021-03-25 14:41:10,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2021-03-25 14:41:10,250 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2021-03-25 14:41:10,250 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:10,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 219 flow [2021-03-25 14:41:10,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 219 flow [2021-03-25 14:41:10,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 219 flow [2021-03-25 14:41:10,262 INFO L129 PetriNetUnfolder]: 25/85 cut-off events. [2021-03-25 14:41:10,263 INFO L130 PetriNetUnfolder]: For 153/155 co-relation queries the response was YES. [2021-03-25 14:41:10,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 85 events. 25/85 cut-off events. For 153/155 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 347 event pairs, 7 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 301. Up to 29 conditions per place. [2021-03-25 14:41:10,264 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-25 14:41:10,267 INFO L154 LiptonReduction]: Checked pairs total: 62 [2021-03-25 14:41:10,267 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:41:10,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 14:41:10,269 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 219 flow [2021-03-25 14:41:10,269 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 14:41:10,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:10,269 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:10,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:41:10,270 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1386146829, now seen corresponding path program 1 times [2021-03-25 14:41:10,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:10,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656237393] [2021-03-25 14:41:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:10,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:10,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:41:10,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:41:10,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:10,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:41:10,369 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 14:41:10,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656237393] [2021-03-25 14:41:10,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:10,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:41:10,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307807486] [2021-03-25 14:41:10,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:41:10,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:41:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:41:10,371 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 154 [2021-03-25 14:41:10,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 14:41:10,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:10,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 154 [2021-03-25 14:41:10,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:10,421 INFO L129 PetriNetUnfolder]: 19/70 cut-off events. [2021-03-25 14:41:10,421 INFO L130 PetriNetUnfolder]: For 179/183 co-relation queries the response was YES. [2021-03-25 14:41:10,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 70 events. 19/70 cut-off events. For 179/183 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 240 event pairs, 2 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 274. Up to 26 conditions per place. [2021-03-25 14:41:10,422 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 11 changer transitions 3/36 dead transitions. [2021-03-25 14:41:10,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 275 flow [2021-03-25 14:41:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:41:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:41:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2021-03-25 14:41:10,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2021-03-25 14:41:10,425 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2021-03-25 14:41:10,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2021-03-25 14:41:10,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:10,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2021-03-25 14:41:10,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 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 14:41:10,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 14:41:10,429 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 14:41:10,429 INFO L185 Difference]: Start difference. First operand has 41 places, 33 transitions, 219 flow. Second operand 7 states and 910 transitions. [2021-03-25 14:41:10,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 275 flow [2021-03-25 14:41:10,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 259 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-25 14:41:10,432 INFO L241 Difference]: Finished difference. Result has 49 places, 33 transitions, 243 flow [2021-03-25 14:41:10,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2021-03-25 14:41:10,432 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2021-03-25 14:41:10,432 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:10,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 33 transitions, 243 flow [2021-03-25 14:41:10,433 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 33 transitions, 243 flow [2021-03-25 14:41:10,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 33 transitions, 243 flow [2021-03-25 14:41:10,441 INFO L129 PetriNetUnfolder]: 18/65 cut-off events. [2021-03-25 14:41:10,442 INFO L130 PetriNetUnfolder]: For 161/163 co-relation queries the response was YES. [2021-03-25 14:41:10,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 65 events. 18/65 cut-off events. For 161/163 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 238. Up to 22 conditions per place. [2021-03-25 14:41:10,442 INFO L142 LiptonReduction]: Number of co-enabled transitions 56 [2021-03-25 14:41:10,721 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:41:10,852 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:41:11,465 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-25 14:41:11,691 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:41:13,710 WARN L205 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 345 DAG size of output: 271 [2021-03-25 14:41:14,256 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 14:41:14,266 INFO L154 LiptonReduction]: Checked pairs total: 102 [2021-03-25 14:41:14,266 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:41:14,266 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3834 [2021-03-25 14:41:14,271 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 215 flow [2021-03-25 14:41:14,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 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 14:41:14,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:14,271 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:14,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:41:14,271 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 596324526, now seen corresponding path program 1 times [2021-03-25 14:41:14,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:14,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095329321] [2021-03-25 14:41:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:41:14,382 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:41:14,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:41:14,410 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:41:14,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:41:14,441 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 14:41:14,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 14:41:14,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:14,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:41:14,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:14,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:41:14,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:41:14,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:41:14,502 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 14:41:14,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095329321] [2021-03-25 14:41:14,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:41:14,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:41:14,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122173635] [2021-03-25 14:41:14,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:41:14,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:41:14,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:41:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:41:14,504 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 156 [2021-03-25 14:41:14,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 215 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 14:41:14,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:41:14,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 156 [2021-03-25 14:41:14,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:41:14,634 INFO L129 PetriNetUnfolder]: 25/72 cut-off events. [2021-03-25 14:41:14,634 INFO L130 PetriNetUnfolder]: For 221/224 co-relation queries the response was YES. [2021-03-25 14:41:14,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 72 events. 25/72 cut-off events. For 221/224 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 221 event pairs, 1 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 303. Up to 33 conditions per place. [2021-03-25 14:41:14,635 INFO L132 encePairwiseOnDemand]: 148/156 looper letters, 12 selfloop transitions, 3 changer transitions 24/47 dead transitions. [2021-03-25 14:41:14,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 389 flow [2021-03-25 14:41:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:41:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:41:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 968 transitions. [2021-03-25 14:41:14,638 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6894586894586895 [2021-03-25 14:41:14,638 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 968 transitions. [2021-03-25 14:41:14,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 968 transitions. [2021-03-25 14:41:14,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:41:14,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 968 transitions. [2021-03-25 14:41:14,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.55555555555556) internal successors, (968), 9 states have internal predecessors, (968), 0 states have call successors, (0), 0 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 14:41:14,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 156.0) internal successors, (1560), 10 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 14:41:14,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 156.0) internal successors, (1560), 10 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 14:41:14,646 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 215 flow. Second operand 9 states and 968 transitions. [2021-03-25 14:41:14,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 389 flow [2021-03-25 14:41:14,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 334 flow, removed 12 selfloop flow, removed 9 redundant places. [2021-03-25 14:41:14,651 INFO L241 Difference]: Finished difference. Result has 45 places, 22 transitions, 147 flow [2021-03-25 14:41:14,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=22} [2021-03-25 14:41:14,652 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2021-03-25 14:41:14,652 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:41:14,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 22 transitions, 147 flow [2021-03-25 14:41:14,652 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 22 transitions, 147 flow [2021-03-25 14:41:14,652 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 22 transitions, 147 flow [2021-03-25 14:41:14,658 INFO L129 PetriNetUnfolder]: 6/29 cut-off events. [2021-03-25 14:41:14,658 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2021-03-25 14:41:14,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 29 events. 6/29 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 96. Up to 14 conditions per place. [2021-03-25 14:41:14,658 INFO L142 LiptonReduction]: Number of co-enabled transitions 6 [2021-03-25 14:41:14,907 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 14:41:15,277 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-25 14:41:15,404 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:41:15,626 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2021-03-25 14:41:15,851 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 87 [2021-03-25 14:41:15,906 INFO L154 LiptonReduction]: Checked pairs total: 7 [2021-03-25 14:41:15,906 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 14:41:15,906 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1254 [2021-03-25 14:41:15,910 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 158 flow [2021-03-25 14:41:15,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 0 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 14:41:15,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:41:15,910 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:41:15,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:41:15,911 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:41:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:41:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1823325194, now seen corresponding path program 1 times [2021-03-25 14:41:15,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:41:15,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425765290] [2021-03-25 14:41:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:41:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:41:15,936 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:41:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:41:15,963 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:41:15,994 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:41:15,995 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:41:15,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:41:16,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:41:16 BasicIcfg [2021-03-25 14:41:16,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:41:16,071 INFO L168 Benchmark]: Toolchain (without parser) took 21884.50 ms. Allocated memory was 346.0 MB in the beginning and 629.1 MB in the end (delta: 283.1 MB). Free memory was 309.3 MB in the beginning and 241.1 MB in the end (delta: 68.2 MB). Peak memory consumption was 353.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,071 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 346.0 MB. Free memory was 327.6 MB in the beginning and 327.6 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:41:16,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.34 ms. Allocated memory is still 346.0 MB. Free memory was 309.1 MB in the beginning and 308.4 MB in the end (delta: 691.9 kB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 346.0 MB. Free memory was 308.4 MB in the beginning and 305.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,072 INFO L168 Benchmark]: Boogie Preprocessor took 44.01 ms. Allocated memory is still 346.0 MB. Free memory was 305.2 MB in the beginning and 303.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,072 INFO L168 Benchmark]: RCFGBuilder took 1522.43 ms. Allocated memory is still 346.0 MB. Free memory was 303.1 MB in the beginning and 290.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 167.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,072 INFO L168 Benchmark]: TraceAbstraction took 19759.57 ms. Allocated memory was 346.0 MB in the beginning and 629.1 MB in the end (delta: 283.1 MB). Free memory was 290.0 MB in the beginning and 241.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 331.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:41:16,073 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.13 ms. Allocated memory is still 346.0 MB. Free memory was 327.6 MB in the beginning and 327.6 MB in the end (delta: 69.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 466.34 ms. Allocated memory is still 346.0 MB. Free memory was 309.1 MB in the beginning and 308.4 MB in the end (delta: 691.9 kB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 346.0 MB. Free memory was 308.4 MB in the beginning and 305.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.01 ms. Allocated memory is still 346.0 MB. Free memory was 305.2 MB in the beginning and 303.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1522.43 ms. Allocated memory is still 346.0 MB. Free memory was 303.1 MB in the beginning and 290.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 167.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19759.57 ms. Allocated memory was 346.0 MB in the beginning and 629.1 MB in the end (delta: 283.1 MB). Free memory was 290.0 MB in the beginning and 241.1 MB in the end (delta: 48.9 MB). Peak memory consumption was 331.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5908.0ms, 87 PlacesBefore, 39 PlacesAfterwards, 82 TransitionsBefore, 33 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 56 TotalNumberOfCompositions, 1715 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 857, positive: 803, positive conditional: 0, positive unconditional: 803, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 670, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 670, positive: 636, positive conditional: 0, positive unconditional: 636, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 670, positive: 634, positive conditional: 0, positive unconditional: 634, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 648, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 643, negative conditional: 0, negative unconditional: 643, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 857, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 670, unknown conditional: 0, unknown unconditional: 670] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5368.1ms, 37 PlacesBefore, 25 PlacesAfterwards, 30 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 283, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 72, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 72, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 283, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 831.5ms, 34 PlacesBefore, 27 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7ms, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 104 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 33, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.1ms, 40 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.3ms, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 62 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 28, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3833.1ms, 49 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 29 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 40, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1254.0ms, 45 PlacesBefore, 38 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 7 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 __unbuffered_p1_EBX = x 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [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 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$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=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19604.1ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 903.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5971.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 38 SDslu, 31 SDs, 0 SdLazy, 235 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 291.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 339.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred 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: 30.9ms SsaConstructionTime, 420.6ms SatisfiabilityAnalysisTime, 653.3ms InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...