/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/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:52:06,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:52:06,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:52:06,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:52:06,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:52:06,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:52:06,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:52:06,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:52:06,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:52:06,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:52:06,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:52:06,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:52:06,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:52:06,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:52:06,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:52:06,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:52:06,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:52:06,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:52:06,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:52:06,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:52:06,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:52:06,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:52:06,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:52:06,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:52:06,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:52:06,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:52:06,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:52:06,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:52:06,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:52:06,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:52:06,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:52:06,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:52:06,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:52:06,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:52:06,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:52:06,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:52:06,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:52:06,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:52:06,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:52:06,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:52:06,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:52:06,930 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:52:06,966 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:52:06,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:52:06,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:52:06,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:52:06,969 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:52:06,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:52:06,970 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:52:06,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:52:06,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:52:06,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:52:06,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:52:06,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:52:06,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:52:06,971 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:52:06,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:52:06,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:52:06,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:52:06,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:52:06,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:52:06,973 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:52:07,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:52:07,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:52:07,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:52:07,307 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:52:07,309 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:52:07,310 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-03-25 14:52:07,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea256148d/e9e398af0e5045ebad0ab115da342e66/FLAGfc6118b58 [2021-03-25 14:52:07,916 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:52:07,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2021-03-25 14:52:07,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea256148d/e9e398af0e5045ebad0ab115da342e66/FLAGfc6118b58 [2021-03-25 14:52:08,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea256148d/e9e398af0e5045ebad0ab115da342e66 [2021-03-25 14:52:08,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:52:08,391 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:52:08,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:08,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:52:08,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:52:08,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:08,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6d5013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08, skipping insertion in model container [2021-03-25 14:52:08,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:08,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:52:08,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:52:08,574 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/safe010_pso.oepc.i[950,963] [2021-03-25 14:52:08,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:08,802 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:52:08,816 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/safe010_pso.oepc.i[950,963] [2021-03-25 14:52:08,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:08,934 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:52:08,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08 WrapperNode [2021-03-25 14:52:08,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:08,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:08,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:52:08,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:52:08,944 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:52:08" (1/1) ... [2021-03-25 14:52:08,979 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:52:08" (1/1) ... [2021-03-25 14:52:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:09,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:52:09,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:52:09,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:52:09,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (1/1) ... [2021-03-25 14:52:09,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:52:09,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:52:09,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:52:09,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:52:09,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (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:52:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:52:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:52:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:52:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:52:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:52:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:52:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:52:09,123 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:52:10,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:52:10,661 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:52:10,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:10 BoogieIcfgContainer [2021-03-25 14:52:10,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:52:10,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:52:10,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:52:10,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:52:10,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:52:08" (1/3) ... [2021-03-25 14:52:10,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fed324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:10, skipping insertion in model container [2021-03-25 14:52:10,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:08" (2/3) ... [2021-03-25 14:52:10,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fed324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:10, skipping insertion in model container [2021-03-25 14:52:10,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:10" (3/3) ... [2021-03-25 14:52:10,670 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2021-03-25 14:52:10,679 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:52:10,683 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:52:10,683 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:52:10,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:10,736 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:52:10,752 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:52:10,779 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:52:10,780 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:52:10,780 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:52:10,780 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:52:10,780 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:52:10,780 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:52:10,780 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:52:10,780 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:52:10,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:52:10,833 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:52:10,833 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:10,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:52:10,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:52:10,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-25 14:52:10,857 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:10,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:52:10,871 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:52:10,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-25 14:52:10,898 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:52:10,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:10,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:52:10,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-25 14:52:11,863 WARN L205 SmtUtils]: Spent 797.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-25 14:52:12,207 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-25 14:52:13,616 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-25 14:52:14,318 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-25 14:52:15,249 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:52:15,588 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:52:15,695 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:52:17,125 WARN L205 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-25 14:52:17,409 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 14:52:18,090 WARN L205 SmtUtils]: Spent 679.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:18,728 WARN L205 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:18,739 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-25 14:52:18,739 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 14:52:18,741 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7885 [2021-03-25 14:52:18,751 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-25 14:52:18,751 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:18,751 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:18,751 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:18,752 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1967679308, now seen corresponding path program 1 times [2021-03-25 14:52:18,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:18,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488777115] [2021-03-25 14:52:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:18,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:18,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:18,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:18,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:18,976 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:52:18,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488777115] [2021-03-25 14:52:18,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:18,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:18,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330808320] [2021-03-25 14:52:18,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:18,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:19,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-03-25 14:52:19,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:19,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:19,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-03-25 14:52:19,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:19,079 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-25 14:52:19,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:19,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 16 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 133. Up to 37 conditions per place. [2021-03-25 14:52:19,081 INFO L132 encePairwiseOnDemand]: 133/137 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-25 14:52:19,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:19,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-25 14:52:19,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2021-03-25 14:52:19,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-25 14:52:19,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-25 14:52:19,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:19,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-25 14:52:19,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:19,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:52:19,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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:52:19,108 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2021-03-25 14:52:19,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:19,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:19,112 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:19,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 14:52:19,115 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-25 14:52:19,115 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:19,115 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:19,116 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:19,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-25 14:52:19,120 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:19,120 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:19,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:52:19,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 14:52:20,141 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-25 14:52:20,451 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:21,556 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-03-25 14:52:22,143 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:22,318 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 14:52:22,318 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:22,319 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3204 [2021-03-25 14:52:22,320 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-25 14:52:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:22,320 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:22,320 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:22,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:52:22,320 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:22,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:22,321 INFO L82 PathProgramCache]: Analyzing trace with hash 434742666, now seen corresponding path program 1 times [2021-03-25 14:52:22,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:22,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220572201] [2021-03-25 14:52:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:22,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:22,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:22,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:22,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:22,438 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:52:22,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:22,448 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:52:22,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220572201] [2021-03-25 14:52:22,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:22,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:22,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727933745] [2021-03-25 14:52:22,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:22,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:22,453 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 142 [2021-03-25 14:52:22,454 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:52:22,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:22,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 142 [2021-03-25 14:52:22,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:22,467 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:22,467 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:22,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:22,468 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-25 14:52:22,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2021-03-25 14:52:22,473 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474178403755869 [2021-03-25 14:52:22,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2021-03-25 14:52:22,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2021-03-25 14:52:22,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:22,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2021-03-25 14:52:22,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:52:22,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:52:22,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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:52:22,484 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 361 transitions. [2021-03-25 14:52:22,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:22,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:22,485 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:22,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-03-25 14:52:22,485 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:22,485 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:22,486 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:22,486 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:22,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:22,490 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:22,490 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:22,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:22,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 14:52:22,626 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:23,115 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:23,426 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:23,541 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 14:52:23,543 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 14:52:23,544 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:52:23,544 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1059 [2021-03-25 14:52:23,544 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 14:52:23,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:52:23,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:23,545 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:23,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:52:23,545 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:23,545 INFO L82 PathProgramCache]: Analyzing trace with hash 942494911, now seen corresponding path program 1 times [2021-03-25 14:52:23,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:23,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745519457] [2021-03-25 14:52:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:23,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:23,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:23,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:23,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:23,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:23,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:23,643 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:52:23,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745519457] [2021-03-25 14:52:23,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:23,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:23,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018252722] [2021-03-25 14:52:23,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:23,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:23,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:23,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2021-03-25 14:52:23,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:23,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:23,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2021-03-25 14:52:23,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:23,665 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:23,665 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-25 14:52:23,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:52:23,666 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2021-03-25 14:52:23,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2021-03-25 14:52:23,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2021-03-25 14:52:23,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2021-03-25 14:52:23,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2021-03-25 14:52:23,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:23,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2021-03-25 14:52:23,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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:52:23,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:52:23,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:52:23,671 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 475 transitions. [2021-03-25 14:52:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:23,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:23,672 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:23,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2021-03-25 14:52:23,672 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2021-03-25 14:52:23,672 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:23,672 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:23,673 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:23,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:23,676 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:52:23,676 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:52:23,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:23,676 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 14:52:24,004 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-25 14:52:24,004 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:24,004 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 332 [2021-03-25 14:52:24,005 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2021-03-25 14:52:24,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:24,006 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:24,006 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:24,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:52:24,006 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1529641860, now seen corresponding path program 1 times [2021-03-25 14:52:24,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:24,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450742080] [2021-03-25 14:52:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:24,087 INFO L142 QuantifierPusher]: treesize reduction 17, result has 39.3 percent of original size [2021-03-25 14:52:24,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:52:24,097 INFO L142 QuantifierPusher]: treesize reduction 17, result has 39.3 percent of original size [2021-03-25 14:52:24,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:52:24,106 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 14:52:24,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:52:24,107 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:52:24,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450742080] [2021-03-25 14:52:24,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:24,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:24,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73170408] [2021-03-25 14:52:24,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:24,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:24,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:24,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:24,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 145 [2021-03-25 14:52:24,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:52:24,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:24,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 145 [2021-03-25 14:52:24,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:24,168 INFO L129 PetriNetUnfolder]: 13/43 cut-off events. [2021-03-25 14:52:24,168 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-25 14:52:24,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 43 events. 13/43 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 2 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 95. Up to 24 conditions per place. [2021-03-25 14:52:24,170 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 8 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2021-03-25 14:52:24,170 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 19 transitions, 84 flow [2021-03-25 14:52:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2021-03-25 14:52:24,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.753448275862069 [2021-03-25 14:52:24,172 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2021-03-25 14:52:24,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2021-03-25 14:52:24,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:24,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2021-03-25 14:52:24,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:52:24,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 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:52:24,175 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 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:52:24,175 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 4 states and 437 transitions. [2021-03-25 14:52:24,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 19 transitions, 84 flow [2021-03-25 14:52:24,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 19 transitions, 72 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:52:24,177 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:24,177 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-03-25 14:52:24,177 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:24,178 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:24,178 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:24,178 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:24,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:24,187 INFO L129 PetriNetUnfolder]: 3/22 cut-off events. [2021-03-25 14:52:24,188 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:52:24,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 22 events. 3/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 1 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 39. Up to 10 conditions per place. [2021-03-25 14:52:24,188 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 14:52:24,199 INFO L154 LiptonReduction]: Checked pairs total: 55 [2021-03-25 14:52:24,199 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:24,199 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 14:52:24,200 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:24,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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:52:24,201 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:24,201 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:24,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:52:24,201 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2037445189, now seen corresponding path program 1 times [2021-03-25 14:52:24,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:24,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682403919] [2021-03-25 14:52:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:24,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:24,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:24,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:24,302 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:52:24,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682403919] [2021-03-25 14:52:24,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:24,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:24,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111696779] [2021-03-25 14:52:24,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:24,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:24,308 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-25 14:52:24,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 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:52:24,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:24,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-25 14:52:24,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:24,342 INFO L129 PetriNetUnfolder]: 10/42 cut-off events. [2021-03-25 14:52:24,342 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:52:24,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 42 events. 10/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 4 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 87. Up to 19 conditions per place. [2021-03-25 14:52:24,343 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 4 selfloop transitions, 5 changer transitions 3/23 dead transitions. [2021-03-25 14:52:24,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 97 flow [2021-03-25 14:52:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2021-03-25 14:52:24,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8055172413793104 [2021-03-25 14:52:24,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2021-03-25 14:52:24,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2021-03-25 14:52:24,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:24,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2021-03-25 14:52:24,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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:52:24,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 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:52:24,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 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:52:24,349 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 59 flow. Second operand 5 states and 584 transitions. [2021-03-25 14:52:24,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 97 flow [2021-03-25 14:52:24,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:24,350 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:24,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-25 14:52:24,350 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-25 14:52:24,351 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:24,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:24,351 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:24,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:24,357 INFO L129 PetriNetUnfolder]: 5/36 cut-off events. [2021-03-25 14:52:24,357 INFO L130 PetriNetUnfolder]: For 15/16 co-relation queries the response was YES. [2021-03-25 14:52:24,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 36 events. 5/36 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 2 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 86. Up to 12 conditions per place. [2021-03-25 14:52:24,358 INFO L142 LiptonReduction]: Number of co-enabled transitions 66 [2021-03-25 14:52:24,381 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-25 14:52:24,381 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:24,381 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 14:52:24,383 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 91 flow [2021-03-25 14:52:24,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 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:52:24,384 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:24,384 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:24,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:52:24,384 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1540542662, now seen corresponding path program 1 times [2021-03-25 14:52:24,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:24,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942425938] [2021-03-25 14:52:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:24,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:24,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:24,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:24,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:24,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:24,479 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:52:24,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942425938] [2021-03-25 14:52:24,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:24,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:24,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143570427] [2021-03-25 14:52:24,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:24,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:24,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 145 [2021-03-25 14:52:24,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:52:24,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:24,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 145 [2021-03-25 14:52:24,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:24,529 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 14:52:24,529 INFO L130 PetriNetUnfolder]: For 30/40 co-relation queries the response was YES. [2021-03-25 14:52:24,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 28 events. 3/28 cut-off events. For 30/40 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 48 event pairs, 0 based on Foata normal form. 14/42 useless extension candidates. Maximal degree in co-relation 79. Up to 12 conditions per place. [2021-03-25 14:52:24,530 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 2 selfloop transitions, 8 changer transitions 2/23 dead transitions. [2021-03-25 14:52:24,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 129 flow [2021-03-25 14:52:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:52:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:52:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2021-03-25 14:52:24,532 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-03-25 14:52:24,532 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2021-03-25 14:52:24,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2021-03-25 14:52:24,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:24,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2021-03-25 14:52:24,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:52:24,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:52:24,540 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:52:24,541 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 91 flow. Second operand 7 states and 812 transitions. [2021-03-25 14:52:24,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 129 flow [2021-03-25 14:52:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 23 transitions, 123 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:24,543 INFO L241 Difference]: Finished difference. Result has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:24,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2021-03-25 14:52:24,543 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2021-03-25 14:52:24,544 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:24,544 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:24,544 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 118 flow [2021-03-25 14:52:24,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 118 flow [2021-03-25 14:52:24,550 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-25 14:52:24,550 INFO L130 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2021-03-25 14:52:24,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 25 events. 2/25 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 71. Up to 10 conditions per place. [2021-03-25 14:52:24,552 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-25 14:52:24,790 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:24,912 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:25,533 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-25 14:52:25,778 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 14:52:27,000 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 343 DAG size of output: 265 [2021-03-25 14:52:27,477 WARN L205 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-25 14:52:27,481 INFO L154 LiptonReduction]: Checked pairs total: 45 [2021-03-25 14:52:27,482 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:27,482 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2938 [2021-03-25 14:52:27,482 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 16 transitions, 96 flow [2021-03-25 14:52:27,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:52:27,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:27,483 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:27,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:52:27,483 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1404694880, now seen corresponding path program 1 times [2021-03-25 14:52:27,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:27,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840151415] [2021-03-25 14:52:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:27,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:27,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:27,573 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.9 percent of original size [2021-03-25 14:52:27,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 14:52:27,596 INFO L142 QuantifierPusher]: treesize reduction 26, result has 58.7 percent of original size [2021-03-25 14:52:27,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 14:52:27,621 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-03-25 14:52:27,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 14:52:27,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:27,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:27,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:27,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:27,676 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:52:27,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840151415] [2021-03-25 14:52:27,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:27,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:52:27,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970204903] [2021-03-25 14:52:27,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:52:27,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:27,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:52:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:52:27,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 148 [2021-03-25 14:52:27,679 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 16 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 99.875) internal successors, (799), 8 states have internal predecessors, (799), 0 states have call successors, (0), 0 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:52:27,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:27,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 148 [2021-03-25 14:52:27,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:27,793 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 14:52:27,793 INFO L130 PetriNetUnfolder]: For 126/130 co-relation queries the response was YES. [2021-03-25 14:52:27,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 27 events. 3/27 cut-off events. For 126/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 5/32 useless extension candidates. Maximal degree in co-relation 97. Up to 12 conditions per place. [2021-03-25 14:52:27,793 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 4 selfloop transitions, 5 changer transitions 3/19 dead transitions. [2021-03-25 14:52:27,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 19 transitions, 136 flow [2021-03-25 14:52:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:52:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:52:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2021-03-25 14:52:27,795 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6814671814671814 [2021-03-25 14:52:27,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2021-03-25 14:52:27,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2021-03-25 14:52:27,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:27,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2021-03-25 14:52:27,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:52:27,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 148.0) internal successors, (1184), 8 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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:52:27,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 148.0) internal successors, (1184), 8 states have internal predecessors, (1184), 0 states have call successors, (0), 0 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:52:27,799 INFO L185 Difference]: Start difference. First operand has 34 places, 16 transitions, 96 flow. Second operand 7 states and 706 transitions. [2021-03-25 14:52:27,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 19 transitions, 136 flow [2021-03-25 14:52:27,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 19 transitions, 105 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-25 14:52:27,801 INFO L241 Difference]: Finished difference. Result has 30 places, 15 transitions, 76 flow [2021-03-25 14:52:27,801 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=30, PETRI_TRANSITIONS=15} [2021-03-25 14:52:27,801 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-25 14:52:27,801 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:27,801 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 15 transitions, 76 flow [2021-03-25 14:52:27,802 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 15 transitions, 76 flow [2021-03-25 14:52:27,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 15 transitions, 76 flow [2021-03-25 14:52:27,805 INFO L129 PetriNetUnfolder]: 2/20 cut-off events. [2021-03-25 14:52:27,805 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-25 14:52:27,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 20 events. 2/20 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2021-03-25 14:52:27,806 INFO L142 LiptonReduction]: Number of co-enabled transitions 8 [2021-03-25 14:52:27,975 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 14:52:28,335 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-25 14:52:28,459 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:52:28,461 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:52:28,461 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:28,461 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 660 [2021-03-25 14:52:28,461 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 15 transitions, 77 flow [2021-03-25 14:52:28,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 99.875) internal successors, (799), 8 states have internal predecessors, (799), 0 states have call successors, (0), 0 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:52:28,462 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:28,462 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:28,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:52:28,462 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash 433911784, now seen corresponding path program 1 times [2021-03-25 14:52:28,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:28,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70397896] [2021-03-25 14:52:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:28,492 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:28,513 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:28,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:52:28,544 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:52:28,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:52:28,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:52:28 BasicIcfg [2021-03-25 14:52:28,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:52:28,618 INFO L168 Benchmark]: Toolchain (without parser) took 20227.18 ms. Allocated memory was 337.6 MB in the beginning and 587.2 MB in the end (delta: 249.6 MB). Free memory was 300.8 MB in the beginning and 344.6 MB in the end (delta: -43.8 MB). Peak memory consumption was 208.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,618 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 337.6 MB. Free memory was 319.3 MB in the beginning and 319.3 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:52:28,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.87 ms. Allocated memory is still 337.6 MB. Free memory was 300.6 MB in the beginning and 298.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.09 ms. Allocated memory is still 337.6 MB. Free memory was 298.9 MB in the beginning and 295.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,619 INFO L168 Benchmark]: Boogie Preprocessor took 51.45 ms. Allocated memory is still 337.6 MB. Free memory was 295.8 MB in the beginning and 293.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,619 INFO L168 Benchmark]: RCFGBuilder took 1598.74 ms. Allocated memory is still 337.6 MB. Free memory was 293.7 MB in the beginning and 275.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 160.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,620 INFO L168 Benchmark]: TraceAbstraction took 17952.53 ms. Allocated memory was 337.6 MB in the beginning and 587.2 MB in the end (delta: 249.6 MB). Free memory was 274.5 MB in the beginning and 344.6 MB in the end (delta: -70.1 MB). Peak memory consumption was 180.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:28,621 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 337.6 MB. Free memory was 319.3 MB in the beginning and 319.3 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 541.87 ms. Allocated memory is still 337.6 MB. Free memory was 300.6 MB in the beginning and 298.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 75.09 ms. Allocated memory is still 337.6 MB. Free memory was 298.9 MB in the beginning and 295.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.45 ms. Allocated memory is still 337.6 MB. Free memory was 295.8 MB in the beginning and 293.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1598.74 ms. Allocated memory is still 337.6 MB. Free memory was 293.7 MB in the beginning and 275.5 MB in the end (delta: 18.2 MB). Peak memory consumption was 160.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17952.53 ms. Allocated memory was 337.6 MB in the beginning and 587.2 MB in the end (delta: 249.6 MB). Free memory was 274.5 MB in the beginning and 344.6 MB in the end (delta: -70.1 MB). Peak memory consumption was 180.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7868.5ms, 83 PlacesBefore, 35 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 774, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, positive: 558, positive conditional: 0, positive unconditional: 558, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 332, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 323, negative conditional: 0, negative unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 774, positive: 166, positive conditional: 0, positive unconditional: 166, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3202.9ms, 33 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1057.5ms, 25 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 119, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 331.5ms, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 210, negative conditional: 0, negative unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.4ms, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 55 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, 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): 62, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.3ms, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2937.6ms, 38 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 16 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 45 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 23, positive conditional: 0, positive unconditional: 23, 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): 24, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 659.3ms, 30 PlacesBefore, 29 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 8 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 22, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2013; [L793] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2014; [L795] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 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) [L750] 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) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 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 [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 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 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L770] 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) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] 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) [L770] 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) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 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 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 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 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] 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) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] 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) [L801] 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) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 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 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 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) [L812] 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) [L813] 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)) [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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) [L816] 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)) [L816] 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)) [L817] 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)) [L817] 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) [L817] 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)) [L817] 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)) [L818] 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)) [L818] 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) [L818] 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)) [L818] 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)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 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, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17770.4ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 482.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7968.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22 SDtfs, 7 SDslu, 12 SDs, 0 SdLazy, 109 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 145.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 194.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.7ms SsaConstructionTime, 282.2ms SatisfiabilityAnalysisTime, 560.4ms InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 413 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...