/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/mix027_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:26:06,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:26:06,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:26:06,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:26:06,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:26:06,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:26:06,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:26:06,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:26:06,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:26:06,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:26:06,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:26:06,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:26:06,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:26:06,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:26:06,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:26:06,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:26:06,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:26:06,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:26:06,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:26:06,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:26:06,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:26:06,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:26:06,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:26:06,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:26:06,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:26:06,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:26:06,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:26:06,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:26:06,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:26:06,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:26:06,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:26:06,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:26:06,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:26:06,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:26:06,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:26:06,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:26:06,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:26:06,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:26:06,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:26:06,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:26:06,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:26:06,947 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:26:07,001 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:26:07,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:26:07,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:26:07,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:26:07,005 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:26:07,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:26:07,006 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:26:07,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:26:07,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:26:07,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:26:07,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:26:07,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:26:07,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:26:07,007 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:26:07,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:26:07,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:26:07,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:26:07,009 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:26:07,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:26:07,010 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:26:07,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:26:07,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:26:07,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:26:07,321 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:26:07,322 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:26:07,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2021-03-25 14:26:07,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418a63012/a8f8193276584f5cad11c1838d0d8e54/FLAGbc1a69664 [2021-03-25 14:26:07,948 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:26:07,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt.i [2021-03-25 14:26:07,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418a63012/a8f8193276584f5cad11c1838d0d8e54/FLAGbc1a69664 [2021-03-25 14:26:08,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/418a63012/a8f8193276584f5cad11c1838d0d8e54 [2021-03-25 14:26:08,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:26:08,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:26:08,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:26:08,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:26:08,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:26:08,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:08,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aae8ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08, skipping insertion in model container [2021-03-25 14:26:08,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:08,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:26:08,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:26:08,668 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/mix027_power.opt.i[950,963] [2021-03-25 14:26:08,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:26:08,853 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:26:08,868 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/mix027_power.opt.i[950,963] [2021-03-25 14:26:08,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:26:08,980 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:26:08,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08 WrapperNode [2021-03-25 14:26:08,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:26:08,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:26:08,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:26:08,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:26:08,988 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:26:08" (1/1) ... [2021-03-25 14:26:09,012 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:26:08" (1/1) ... [2021-03-25 14:26:09,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:26:09,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:26:09,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:26:09,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:26:09,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (1/1) ... [2021-03-25 14:26:09,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:26:09,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:26:09,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:26:09,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:26:09,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26: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:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:26:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:26:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:26:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:26:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:26:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:26:09,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:26:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:26:09,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:26:09,155 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:26:10,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:26:10,689 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:26:10,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:26:10 BoogieIcfgContainer [2021-03-25 14:26:10,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:26:10,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:26:10,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:26:10,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:26:10,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:26:08" (1/3) ... [2021-03-25 14:26:10,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a63300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:26:10, skipping insertion in model container [2021-03-25 14:26:10,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:26:08" (2/3) ... [2021-03-25 14:26:10,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a63300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:26:10, skipping insertion in model container [2021-03-25 14:26:10,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:26:10" (3/3) ... [2021-03-25 14:26:10,697 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2021-03-25 14:26:10,703 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:26:10,706 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:26:10,707 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:26:10,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,751 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,768 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,779 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,780 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,781 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,781 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,782 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,796 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,796 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,797 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,801 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,801 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:26:10,802 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:26:10,818 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:26:10,844 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:26:10,845 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:26:10,845 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:26:10,845 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:26:10,845 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:26:10,845 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:26:10,845 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:26:10,845 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:26:10,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:26:10,907 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:26:10,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:10,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:26:10,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-25 14:26:10,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-25 14:26:10,923 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:10,932 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:26:10,935 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-25 14:26:10,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-25 14:26:10,965 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:26:10,965 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:10,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:26:10,973 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-25 14:26:12,406 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:26:12,858 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:26:12,983 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:26:14,514 INFO L154 LiptonReduction]: Checked pairs total: 4605 [2021-03-25 14:26:14,514 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 14:26:14,516 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3595 [2021-03-25 14:26:14,525 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 14:26:14,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:14,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:14,526 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:14,527 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2053805617, now seen corresponding path program 1 times [2021-03-25 14:26:14,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:14,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330867325] [2021-03-25 14:26:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:14,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:14,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:14,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:14,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:14,817 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:26:14,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330867325] [2021-03-25 14:26:14,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:14,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:26:14,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425492772] [2021-03-25 14:26:14,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:14,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:14,841 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2021-03-25 14:26:14,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:14,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:14,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2021-03-25 14:26:14,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:14,930 INFO L129 PetriNetUnfolder]: 29/148 cut-off events. [2021-03-25 14:26:14,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:14,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 148 events. 29/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 608 event pairs, 15 based on Foata normal form. 9/137 useless extension candidates. Maximal degree in co-relation 193. Up to 41 conditions per place. [2021-03-25 14:26:14,934 INFO L132 encePairwiseOnDemand]: 185/189 looper letters, 7 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-03-25 14:26:14,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 122 flow [2021-03-25 14:26:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-25 14:26:14,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2021-03-25 14:26:14,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-25 14:26:14,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-25 14:26:14,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:14,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-25 14:26:14,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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:26:14,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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:26:14,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 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:26:14,981 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 525 transitions. [2021-03-25 14:26:14,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 122 flow [2021-03-25 14:26:14,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:26:14,986 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-25 14:26:14,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 14:26:14,988 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:26:14,988 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:14,989 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:26:14,990 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:26:14,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-25 14:26:14,999 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-25 14:26:14,999 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:14,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:26:15,000 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-25 14:26:16,601 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:26:17,231 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:26:17,397 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:26:17,731 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:26:17,876 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:26:17,883 INFO L154 LiptonReduction]: Checked pairs total: 2595 [2021-03-25 14:26:17,883 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-25 14:26:17,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2895 [2021-03-25 14:26:17,884 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-25 14:26:17,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:17,885 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:17,885 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:17,885 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:26:17,885 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:17,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:17,886 INFO L82 PathProgramCache]: Analyzing trace with hash 263353425, now seen corresponding path program 1 times [2021-03-25 14:26:17,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:17,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952186956] [2021-03-25 14:26:17,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:18,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:18,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:18,011 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:26:18,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:26:18,026 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:26:18,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:26:18,035 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:26:18,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952186956] [2021-03-25 14:26:18,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:18,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:18,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388323349] [2021-03-25 14:26:18,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:18,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:18,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2021-03-25 14:26:18,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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:26:18,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:18,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2021-03-25 14:26:18,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:18,216 INFO L129 PetriNetUnfolder]: 313/637 cut-off events. [2021-03-25 14:26:18,216 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:26:18,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 637 events. 313/637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3536 event pairs, 41 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 1134. Up to 135 conditions per place. [2021-03-25 14:26:18,220 INFO L132 encePairwiseOnDemand]: 195/204 looper letters, 11 selfloop transitions, 7 changer transitions 19/55 dead transitions. [2021-03-25 14:26:18,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 196 flow [2021-03-25 14:26:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:26:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:26:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1152 transitions. [2021-03-25 14:26:18,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8067226890756303 [2021-03-25 14:26:18,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1152 transitions. [2021-03-25 14:26:18,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1152 transitions. [2021-03-25 14:26:18,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:18,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1152 transitions. [2021-03-25 14:26:18,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 164.57142857142858) internal successors, (1152), 7 states have internal predecessors, (1152), 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:26:18,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:26:18,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:26:18,231 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 7 states and 1152 transitions. [2021-03-25 14:26:18,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 196 flow [2021-03-25 14:26:18,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:26:18,232 INFO L241 Difference]: Finished difference. Result has 48 places, 32 transitions, 124 flow [2021-03-25 14:26:18,232 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2021-03-25 14:26:18,233 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2021-03-25 14:26:18,233 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:18,233 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 32 transitions, 124 flow [2021-03-25 14:26:18,234 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 32 transitions, 124 flow [2021-03-25 14:26:18,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 124 flow [2021-03-25 14:26:18,264 INFO L129 PetriNetUnfolder]: 128/302 cut-off events. [2021-03-25 14:26:18,264 INFO L130 PetriNetUnfolder]: For 154/180 co-relation queries the response was YES. [2021-03-25 14:26:18,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 302 events. 128/302 cut-off events. For 154/180 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1622 event pairs, 49 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 736. Up to 132 conditions per place. [2021-03-25 14:26:18,268 INFO L142 LiptonReduction]: Number of co-enabled transitions 426 [2021-03-25 14:26:18,294 INFO L154 LiptonReduction]: Checked pairs total: 230 [2021-03-25 14:26:18,295 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:18,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-25 14:26:18,296 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 124 flow [2021-03-25 14:26:18,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 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:26:18,296 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:18,296 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:18,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:26:18,297 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:18,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash 69528930, now seen corresponding path program 1 times [2021-03-25 14:26:18,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:18,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402472037] [2021-03-25 14:26:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:18,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:18,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:26:18,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402472037] [2021-03-25 14:26:18,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:18,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:26:18,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111466098] [2021-03-25 14:26:18,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:18,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:18,374 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 204 [2021-03-25 14:26:18,374 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:26:18,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:18,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 204 [2021-03-25 14:26:18,375 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:18,416 INFO L129 PetriNetUnfolder]: 112/287 cut-off events. [2021-03-25 14:26:18,416 INFO L130 PetriNetUnfolder]: For 251/314 co-relation queries the response was YES. [2021-03-25 14:26:18,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 287 events. 112/287 cut-off events. For 251/314 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1499 event pairs, 33 based on Foata normal form. 4/267 useless extension candidates. Maximal degree in co-relation 762. Up to 120 conditions per place. [2021-03-25 14:26:18,419 INFO L132 encePairwiseOnDemand]: 200/204 looper letters, 5 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2021-03-25 14:26:18,419 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 168 flow [2021-03-25 14:26:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2021-03-25 14:26:18,421 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8986928104575164 [2021-03-25 14:26:18,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 550 transitions. [2021-03-25 14:26:18,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 550 transitions. [2021-03-25 14:26:18,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:18,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 550 transitions. [2021-03-25 14:26:18,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:18,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:26:18,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:26:18,424 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 124 flow. Second operand 3 states and 550 transitions. [2021-03-25 14:26:18,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 168 flow [2021-03-25 14:26:18,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 152 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-25 14:26:18,429 INFO L241 Difference]: Finished difference. Result has 44 places, 36 transitions, 157 flow [2021-03-25 14:26:18,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2021-03-25 14:26:18,429 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-25 14:26:18,429 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:18,429 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 36 transitions, 157 flow [2021-03-25 14:26:18,430 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 36 transitions, 157 flow [2021-03-25 14:26:18,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 157 flow [2021-03-25 14:26:18,458 INFO L129 PetriNetUnfolder]: 105/286 cut-off events. [2021-03-25 14:26:18,459 INFO L130 PetriNetUnfolder]: For 153/161 co-relation queries the response was YES. [2021-03-25 14:26:18,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 286 events. 105/286 cut-off events. For 153/161 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1562 event pairs, 27 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 674. Up to 110 conditions per place. [2021-03-25 14:26:18,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-25 14:26:18,488 INFO L154 LiptonReduction]: Checked pairs total: 306 [2021-03-25 14:26:18,488 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:18,488 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 14:26:18,492 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 157 flow [2021-03-25 14:26:18,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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:26:18,493 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:18,493 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:18,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:26:18,493 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash -909411146, now seen corresponding path program 1 times [2021-03-25 14:26:18,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:18,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561823377] [2021-03-25 14:26:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:18,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:18,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:18,571 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:18,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:18,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:18,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:18,578 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:26:18,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561823377] [2021-03-25 14:26:18,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:18,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:18,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817331512] [2021-03-25 14:26:18,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:18,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:18,580 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:26:18,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:18,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:18,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:26:18,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:18,775 INFO L129 PetriNetUnfolder]: 828/1542 cut-off events. [2021-03-25 14:26:18,775 INFO L130 PetriNetUnfolder]: For 382/473 co-relation queries the response was YES. [2021-03-25 14:26:18,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 1542 events. 828/1542 cut-off events. For 382/473 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 11211 event pairs, 369 based on Foata normal form. 96/1324 useless extension candidates. Maximal degree in co-relation 3404. Up to 1006 conditions per place. [2021-03-25 14:26:18,789 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 12 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2021-03-25 14:26:18,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 229 flow [2021-03-25 14:26:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:26:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:26:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 859 transitions. [2021-03-25 14:26:18,792 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.842156862745098 [2021-03-25 14:26:18,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 859 transitions. [2021-03-25 14:26:18,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 859 transitions. [2021-03-25 14:26:18,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:18,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 859 transitions. [2021-03-25 14:26:18,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:26:18,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:26:18,797 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:26:18,797 INFO L185 Difference]: Start difference. First operand has 44 places, 36 transitions, 157 flow. Second operand 5 states and 859 transitions. [2021-03-25 14:26:18,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 229 flow [2021-03-25 14:26:18,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:18,802 INFO L241 Difference]: Finished difference. Result has 50 places, 45 transitions, 227 flow [2021-03-25 14:26:18,802 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2021-03-25 14:26:18,802 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-25 14:26:18,802 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:18,802 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 45 transitions, 227 flow [2021-03-25 14:26:18,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 45 transitions, 227 flow [2021-03-25 14:26:18,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 45 transitions, 227 flow [2021-03-25 14:26:18,901 INFO L129 PetriNetUnfolder]: 630/1236 cut-off events. [2021-03-25 14:26:18,902 INFO L130 PetriNetUnfolder]: For 863/1395 co-relation queries the response was YES. [2021-03-25 14:26:18,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 1236 events. 630/1236 cut-off events. For 863/1395 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 8963 event pairs, 262 based on Foata normal form. 7/1085 useless extension candidates. Maximal degree in co-relation 3536. Up to 811 conditions per place. [2021-03-25 14:26:18,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 774 [2021-03-25 14:26:19,076 INFO L154 LiptonReduction]: Checked pairs total: 490 [2021-03-25 14:26:19,076 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:26:19,076 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 274 [2021-03-25 14:26:19,077 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 221 flow [2021-03-25 14:26:19,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:19,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:19,078 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:19,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:26:19,078 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:19,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1872757296, now seen corresponding path program 1 times [2021-03-25 14:26:19,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:19,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173093137] [2021-03-25 14:26:19,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:19,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,117 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:19,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:19,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:19,125 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:26:19,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173093137] [2021-03-25 14:26:19,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:19,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:26:19,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029663515] [2021-03-25 14:26:19,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:19,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:19,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:19,127 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:26:19,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:19,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:19,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:26:19,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:19,301 INFO L129 PetriNetUnfolder]: 554/1105 cut-off events. [2021-03-25 14:26:19,301 INFO L130 PetriNetUnfolder]: For 1146/2686 co-relation queries the response was YES. [2021-03-25 14:26:19,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 1105 events. 554/1105 cut-off events. For 1146/2686 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 7450 event pairs, 80 based on Foata normal form. 170/1145 useless extension candidates. Maximal degree in co-relation 3860. Up to 728 conditions per place. [2021-03-25 14:26:19,313 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 13 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2021-03-25 14:26:19,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 331 flow [2021-03-25 14:26:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:26:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:26:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1031 transitions. [2021-03-25 14:26:19,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8423202614379085 [2021-03-25 14:26:19,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1031 transitions. [2021-03-25 14:26:19,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1031 transitions. [2021-03-25 14:26:19,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:19,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1031 transitions. [2021-03-25 14:26:19,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 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:26:19,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:26:19,321 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:26:19,322 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 221 flow. Second operand 6 states and 1031 transitions. [2021-03-25 14:26:19,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 331 flow [2021-03-25 14:26:19,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:26:19,329 INFO L241 Difference]: Finished difference. Result has 54 places, 49 transitions, 310 flow [2021-03-25 14:26:19,330 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2021-03-25 14:26:19,330 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:26:19,330 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:19,330 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 310 flow [2021-03-25 14:26:19,330 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 310 flow [2021-03-25 14:26:19,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 310 flow [2021-03-25 14:26:19,405 INFO L129 PetriNetUnfolder]: 396/874 cut-off events. [2021-03-25 14:26:19,405 INFO L130 PetriNetUnfolder]: For 1997/2568 co-relation queries the response was YES. [2021-03-25 14:26:19,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3576 conditions, 874 events. 396/874 cut-off events. For 1997/2568 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6082 event pairs, 77 based on Foata normal form. 25/832 useless extension candidates. Maximal degree in co-relation 3557. Up to 580 conditions per place. [2021-03-25 14:26:19,419 INFO L142 LiptonReduction]: Number of co-enabled transitions 890 [2021-03-25 14:26:19,541 INFO L154 LiptonReduction]: Checked pairs total: 542 [2021-03-25 14:26:19,542 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:26:19,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 212 [2021-03-25 14:26:19,545 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 302 flow [2021-03-25 14:26:19,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:26:19,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:19,546 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:19,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:26:19,546 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:19,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -768381807, now seen corresponding path program 1 times [2021-03-25 14:26:19,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:19,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189093420] [2021-03-25 14:26:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:19,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:19,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,618 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:26:19,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189093420] [2021-03-25 14:26:19,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:19,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:26:19,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128772168] [2021-03-25 14:26:19,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:26:19,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:26:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:26:19,620 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 204 [2021-03-25 14:26:19,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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:26:19,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:19,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 204 [2021-03-25 14:26:19,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:19,720 INFO L129 PetriNetUnfolder]: 436/933 cut-off events. [2021-03-25 14:26:19,721 INFO L130 PetriNetUnfolder]: For 2293/2740 co-relation queries the response was YES. [2021-03-25 14:26:19,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 933 events. 436/933 cut-off events. For 2293/2740 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6188 event pairs, 112 based on Foata normal form. 54/923 useless extension candidates. Maximal degree in co-relation 3837. Up to 609 conditions per place. [2021-03-25 14:26:19,730 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 4 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2021-03-25 14:26:19,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 282 flow [2021-03-25 14:26:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:26:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:26:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2021-03-25 14:26:19,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2021-03-25 14:26:19,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2021-03-25 14:26:19,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2021-03-25 14:26:19,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:19,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2021-03-25 14:26:19,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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:26:19,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:26:19,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:26:19,735 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 302 flow. Second operand 3 states and 549 transitions. [2021-03-25 14:26:19,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 282 flow [2021-03-25 14:26:19,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 244 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:26:19,750 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 244 flow [2021-03-25 14:26:19,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2021-03-25 14:26:19,750 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2021-03-25 14:26:19,751 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:19,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 244 flow [2021-03-25 14:26:19,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 244 flow [2021-03-25 14:26:19,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 244 flow [2021-03-25 14:26:19,826 INFO L129 PetriNetUnfolder]: 437/939 cut-off events. [2021-03-25 14:26:19,826 INFO L130 PetriNetUnfolder]: For 1363/1530 co-relation queries the response was YES. [2021-03-25 14:26:19,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 939 events. 437/939 cut-off events. For 1363/1530 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6299 event pairs, 101 based on Foata normal form. 32/902 useless extension candidates. Maximal degree in co-relation 2947. Up to 558 conditions per place. [2021-03-25 14:26:19,838 INFO L142 LiptonReduction]: Number of co-enabled transitions 738 [2021-03-25 14:26:19,889 INFO L154 LiptonReduction]: Checked pairs total: 231 [2021-03-25 14:26:19,890 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:19,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-03-25 14:26:19,892 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 244 flow [2021-03-25 14:26:19,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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:26:19,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:19,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:19,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:26:19,892 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash -390301313, now seen corresponding path program 2 times [2021-03-25 14:26:19,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:19,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733366531] [2021-03-25 14:26:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:19,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:19,985 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:19,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:19,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:19,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:19,997 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:26:19,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733366531] [2021-03-25 14:26:19,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:19,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:26:19,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99673725] [2021-03-25 14:26:19,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:26:19,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:19,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:26:19,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:26:19,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:26:20,000 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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:26:20,000 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:20,001 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:26:20,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:20,164 INFO L129 PetriNetUnfolder]: 573/1125 cut-off events. [2021-03-25 14:26:20,164 INFO L130 PetriNetUnfolder]: For 1664/2961 co-relation queries the response was YES. [2021-03-25 14:26:20,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 1125 events. 573/1125 cut-off events. For 1664/2961 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 7359 event pairs, 28 based on Foata normal form. 262/1251 useless extension candidates. Maximal degree in co-relation 4070. Up to 688 conditions per place. [2021-03-25 14:26:20,174 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 10 selfloop transitions, 18 changer transitions 4/60 dead transitions. [2021-03-25 14:26:20,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 416 flow [2021-03-25 14:26:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:26:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:26:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1203 transitions. [2021-03-25 14:26:20,178 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.842436974789916 [2021-03-25 14:26:20,178 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1203 transitions. [2021-03-25 14:26:20,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1203 transitions. [2021-03-25 14:26:20,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:20,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1203 transitions. [2021-03-25 14:26:20,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 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:26:20,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:26:20,183 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:26:20,183 INFO L185 Difference]: Start difference. First operand has 51 places, 44 transitions, 244 flow. Second operand 7 states and 1203 transitions. [2021-03-25 14:26:20,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 416 flow [2021-03-25 14:26:20,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 406 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:20,223 INFO L241 Difference]: Finished difference. Result has 59 places, 53 transitions, 372 flow [2021-03-25 14:26:20,223 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=372, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2021-03-25 14:26:20,223 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-25 14:26:20,223 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:20,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 372 flow [2021-03-25 14:26:20,224 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 372 flow [2021-03-25 14:26:20,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 372 flow [2021-03-25 14:26:20,288 INFO L129 PetriNetUnfolder]: 294/713 cut-off events. [2021-03-25 14:26:20,289 INFO L130 PetriNetUnfolder]: For 1739/1884 co-relation queries the response was YES. [2021-03-25 14:26:20,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 713 events. 294/713 cut-off events. For 1739/1884 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4763 event pairs, 28 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 2971. Up to 460 conditions per place. [2021-03-25 14:26:20,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 866 [2021-03-25 14:26:20,403 INFO L154 LiptonReduction]: Checked pairs total: 887 [2021-03-25 14:26:20,403 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:26:20,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 180 [2021-03-25 14:26:20,405 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 362 flow [2021-03-25 14:26:20,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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:26:20,406 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:20,406 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:20,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:26:20,406 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash -542986508, now seen corresponding path program 1 times [2021-03-25 14:26:20,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:20,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908488874] [2021-03-25 14:26:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:20,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:20,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:20,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:20,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:20,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:20,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:20,485 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:26:20,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:26:20,498 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:26:20,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908488874] [2021-03-25 14:26:20,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:20,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:26:20,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477234816] [2021-03-25 14:26:20,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:26:20,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:20,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:26:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:26:20,500 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 204 [2021-03-25 14:26:20,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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:26:20,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:20,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 204 [2021-03-25 14:26:20,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:20,679 INFO L129 PetriNetUnfolder]: 502/1140 cut-off events. [2021-03-25 14:26:20,679 INFO L130 PetriNetUnfolder]: For 2491/2738 co-relation queries the response was YES. [2021-03-25 14:26:20,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4441 conditions, 1140 events. 502/1140 cut-off events. For 2491/2738 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7830 event pairs, 31 based on Foata normal form. 12/1092 useless extension candidates. Maximal degree in co-relation 4418. Up to 565 conditions per place. [2021-03-25 14:26:20,690 INFO L132 encePairwiseOnDemand]: 194/204 looper letters, 28 selfloop transitions, 28 changer transitions 0/85 dead transitions. [2021-03-25 14:26:20,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 85 transitions, 637 flow [2021-03-25 14:26:20,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:26:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:26:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 996 transitions. [2021-03-25 14:26:20,693 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8137254901960784 [2021-03-25 14:26:20,693 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 996 transitions. [2021-03-25 14:26:20,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 996 transitions. [2021-03-25 14:26:20,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:20,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 996 transitions. [2021-03-25 14:26:20,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 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:26:20,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:26:20,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 204.0) internal successors, (1428), 7 states have internal predecessors, (1428), 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:26:20,698 INFO L185 Difference]: Start difference. First operand has 59 places, 52 transitions, 362 flow. Second operand 6 states and 996 transitions. [2021-03-25 14:26:20,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 85 transitions, 637 flow [2021-03-25 14:26:20,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 596 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:26:20,722 INFO L241 Difference]: Finished difference. Result has 63 places, 73 transitions, 571 flow [2021-03-25 14:26:20,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2021-03-25 14:26:20,722 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2021-03-25 14:26:20,722 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:20,722 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 73 transitions, 571 flow [2021-03-25 14:26:20,722 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 571 flow [2021-03-25 14:26:20,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 571 flow [2021-03-25 14:26:20,821 INFO L129 PetriNetUnfolder]: 489/1145 cut-off events. [2021-03-25 14:26:20,821 INFO L130 PetriNetUnfolder]: For 1908/1979 co-relation queries the response was YES. [2021-03-25 14:26:20,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4025 conditions, 1145 events. 489/1145 cut-off events. For 1908/1979 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8248 event pairs, 35 based on Foata normal form. 8/1103 useless extension candidates. Maximal degree in co-relation 4000. Up to 421 conditions per place. [2021-03-25 14:26:20,842 INFO L142 LiptonReduction]: Number of co-enabled transitions 1142 [2021-03-25 14:26:20,977 INFO L154 LiptonReduction]: Checked pairs total: 410 [2021-03-25 14:26:20,978 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:26:20,978 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 256 [2021-03-25 14:26:20,978 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 571 flow [2021-03-25 14:26:20,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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:26:20,978 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:20,979 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:20,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:26:20,979 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash -764001864, now seen corresponding path program 2 times [2021-03-25 14:26:20,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:20,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100604158] [2021-03-25 14:26:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:21,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:21,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:21,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:21,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:21,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:21,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:21,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:21,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:21,053 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:26:21,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:26:21,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:21,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:21,063 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:26:21,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100604158] [2021-03-25 14:26:21,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:21,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:26:21,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381016122] [2021-03-25 14:26:21,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:26:21,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:21,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:26:21,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:26:21,065 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 204 [2021-03-25 14:26:21,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 571 flow. Second operand has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 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:26:21,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:21,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 204 [2021-03-25 14:26:21,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:21,381 INFO L129 PetriNetUnfolder]: 988/1866 cut-off events. [2021-03-25 14:26:21,381 INFO L130 PetriNetUnfolder]: For 3102/4651 co-relation queries the response was YES. [2021-03-25 14:26:21,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 1866 events. 988/1866 cut-off events. For 3102/4651 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 12900 event pairs, 27 based on Foata normal form. 281/1884 useless extension candidates. Maximal degree in co-relation 7086. Up to 654 conditions per place. [2021-03-25 14:26:21,402 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 6 selfloop transitions, 18 changer transitions 5/82 dead transitions. [2021-03-25 14:26:21,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 685 flow [2021-03-25 14:26:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:26:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:26:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1367 transitions. [2021-03-25 14:26:21,406 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8376225490196079 [2021-03-25 14:26:21,406 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1367 transitions. [2021-03-25 14:26:21,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1367 transitions. [2021-03-25 14:26:21,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:21,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1367 transitions. [2021-03-25 14:26:21,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.875) internal successors, (1367), 8 states have internal predecessors, (1367), 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:26:21,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 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:26:21,413 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 204.0) internal successors, (1836), 9 states have internal predecessors, (1836), 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:26:21,413 INFO L185 Difference]: Start difference. First operand has 63 places, 73 transitions, 571 flow. Second operand 8 states and 1367 transitions. [2021-03-25 14:26:21,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 685 flow [2021-03-25 14:26:21,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 661 flow, removed 10 selfloop flow, removed 1 redundant places. [2021-03-25 14:26:21,456 INFO L241 Difference]: Finished difference. Result has 72 places, 74 transitions, 615 flow [2021-03-25 14:26:21,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=615, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2021-03-25 14:26:21,456 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-25 14:26:21,456 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:21,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 74 transitions, 615 flow [2021-03-25 14:26:21,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 74 transitions, 615 flow [2021-03-25 14:26:21,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions, 615 flow [2021-03-25 14:26:21,559 INFO L129 PetriNetUnfolder]: 430/1012 cut-off events. [2021-03-25 14:26:21,559 INFO L130 PetriNetUnfolder]: For 2308/2458 co-relation queries the response was YES. [2021-03-25 14:26:21,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 1012 events. 430/1012 cut-off events. For 2308/2458 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7269 event pairs, 23 based on Foata normal form. 12/975 useless extension candidates. Maximal degree in co-relation 4182. Up to 355 conditions per place. [2021-03-25 14:26:21,577 INFO L142 LiptonReduction]: Number of co-enabled transitions 1080 [2021-03-25 14:26:22,006 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:26:22,124 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:26:22,586 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:26:22,729 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:26:22,833 INFO L154 LiptonReduction]: Checked pairs total: 885 [2021-03-25 14:26:22,834 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:26:22,834 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1378 [2021-03-25 14:26:22,834 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 599 flow [2021-03-25 14:26:22,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 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:26:22,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:22,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:22,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:26:22,835 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash -987468505, now seen corresponding path program 1 times [2021-03-25 14:26:22,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:22,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293498204] [2021-03-25 14:26:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:26:22,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:22,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:26:22,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:26:22,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:26:22,899 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:26:22,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:26:22,909 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:26:22,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293498204] [2021-03-25 14:26:22,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:26:22,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:26:22,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746784343] [2021-03-25 14:26:22,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:26:22,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:26:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:26:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:26:22,911 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 206 [2021-03-25 14:26:22,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 599 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:26:22,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:26:22,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 206 [2021-03-25 14:26:22,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:26:23,094 INFO L129 PetriNetUnfolder]: 579/1279 cut-off events. [2021-03-25 14:26:23,095 INFO L130 PetriNetUnfolder]: For 5753/6480 co-relation queries the response was YES. [2021-03-25 14:26:23,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 1279 events. 579/1279 cut-off events. For 5753/6480 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 9233 event pairs, 24 based on Foata normal form. 67/1266 useless extension candidates. Maximal degree in co-relation 5488. Up to 414 conditions per place. [2021-03-25 14:26:23,104 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 5 selfloop transitions, 5 changer transitions 58/96 dead transitions. [2021-03-25 14:26:23,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 969 flow [2021-03-25 14:26:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:26:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:26:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2021-03-25 14:26:23,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8240291262135923 [2021-03-25 14:26:23,107 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2021-03-25 14:26:23,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2021-03-25 14:26:23,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:26:23,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2021-03-25 14:26:23,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 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:26:23,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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:26:23,110 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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:26:23,110 INFO L185 Difference]: Start difference. First operand has 68 places, 71 transitions, 599 flow. Second operand 4 states and 679 transitions. [2021-03-25 14:26:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 969 flow [2021-03-25 14:26:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 908 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 14:26:23,145 INFO L241 Difference]: Finished difference. Result has 64 places, 38 transitions, 238 flow [2021-03-25 14:26:23,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2021-03-25 14:26:23,146 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2021-03-25 14:26:23,146 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:26:23,146 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 38 transitions, 238 flow [2021-03-25 14:26:23,147 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 38 transitions, 238 flow [2021-03-25 14:26:23,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 38 transitions, 238 flow [2021-03-25 14:26:23,157 INFO L129 PetriNetUnfolder]: 33/97 cut-off events. [2021-03-25 14:26:23,157 INFO L130 PetriNetUnfolder]: For 433/456 co-relation queries the response was YES. [2021-03-25 14:26:23,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 97 events. 33/97 cut-off events. For 433/456 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 321 event pairs, 4 based on Foata normal form. 12/105 useless extension candidates. Maximal degree in co-relation 308. Up to 30 conditions per place. [2021-03-25 14:26:23,160 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 14:26:23,313 INFO L154 LiptonReduction]: Checked pairs total: 350 [2021-03-25 14:26:23,314 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:26:23,314 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-25 14:26:23,314 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 248 flow [2021-03-25 14:26:23,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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:26:23,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:26:23,315 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:26:23,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:26:23,315 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:26:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:26:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2042327437, now seen corresponding path program 1 times [2021-03-25 14:26:23,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:26:23,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310636552] [2021-03-25 14:26:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:26:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:23,347 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:26:23,393 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:26:23,419 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:26:23,420 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:26:23,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:26:23,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:26:23 BasicIcfg [2021-03-25 14:26:23,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:26:23,531 INFO L168 Benchmark]: Toolchain (without parser) took 15111.34 ms. Allocated memory was 255.9 MB in the beginning and 650.1 MB in the end (delta: 394.3 MB). Free memory was 232.6 MB in the beginning and 490.3 MB in the end (delta: -257.7 MB). Peak memory consumption was 135.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:23,531 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:26:23,531 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.43 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.6 MB in the beginning and 309.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:23,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 350.2 MB. Free memory was 309.0 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:23,532 INFO L168 Benchmark]: Boogie Preprocessor took 34.30 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.3 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:26:23,532 INFO L168 Benchmark]: RCFGBuilder took 1611.14 ms. Allocated memory is still 350.2 MB. Free memory was 304.3 MB in the beginning and 315.4 MB in the end (delta: -11.0 MB). Peak memory consumption was 65.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:23,533 INFO L168 Benchmark]: TraceAbstraction took 12838.10 ms. Allocated memory was 350.2 MB in the beginning and 650.1 MB in the end (delta: 299.9 MB). Free memory was 314.3 MB in the beginning and 490.3 MB in the end (delta: -176.0 MB). Peak memory consumption was 123.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:26:23,537 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 558.43 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 232.6 MB in the beginning and 309.0 MB in the end (delta: -76.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 350.2 MB. Free memory was 309.0 MB in the beginning and 306.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.30 ms. Allocated memory is still 350.2 MB. Free memory was 306.5 MB in the beginning and 304.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1611.14 ms. Allocated memory is still 350.2 MB. Free memory was 304.3 MB in the beginning and 315.4 MB in the end (delta: -11.0 MB). Peak memory consumption was 65.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12838.10 ms. Allocated memory was 350.2 MB in the beginning and 650.1 MB in the end (delta: 299.9 MB). Free memory was 314.3 MB in the beginning and 490.3 MB in the end (delta: -176.0 MB). Peak memory consumption was 123.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3579.6ms, 122 PlacesBefore, 58 PlacesAfterwards, 111 TransitionsBefore, 46 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4605 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2114, positive: 2004, positive conditional: 0, positive unconditional: 2004, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1560, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1560, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1560, positive: 1508, positive conditional: 0, positive unconditional: 1508, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 499, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 469, negative conditional: 0, negative unconditional: 469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2114, positive: 486, positive conditional: 0, positive unconditional: 486, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 1560, unknown conditional: 0, unknown unconditional: 1560] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2893.7ms, 54 PlacesBefore, 39 PlacesAfterwards, 43 TransitionsBefore, 28 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 2595 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 840, positive: 703, positive conditional: 0, positive unconditional: 703, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 289, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 253, negative conditional: 0, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 840, positive: 601, positive conditional: 0, positive unconditional: 601, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 118, unknown conditional: 0, unknown unconditional: 118] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.7ms, 48 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 230 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.1ms, 44 PlacesBefore, 44 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 144, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 273.6ms, 50 PlacesBefore, 50 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 490 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 187, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 187, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 199, Positive conditional cache size: 0, Positive unconditional cache size: 199, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 211.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 201, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 201, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 200, Positive conditional cache size: 0, Positive unconditional cache size: 200, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 138.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 231 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 82, positive: 73, positive conditional: 0, positive unconditional: 73, 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): 226, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 179.3ms, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 887 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 207, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 207, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 201, Positive conditional cache size: 0, Positive unconditional cache size: 201, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 255.2ms, 63 PlacesBefore, 63 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 410 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 70, positive conditional: 0, positive unconditional: 70, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 79, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1376.8ms, 72 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 71 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 885 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 139, positive conditional: 0, positive unconditional: 139, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 160, positive: 128, positive conditional: 0, positive unconditional: 128, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 167.0ms, 64 PlacesBefore, 62 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 87, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L777] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L867] 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) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] 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) [L867] 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) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 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 [L870] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 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 [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12580.7ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2043.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3675.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 83 SDtfs, 63 SDslu, 72 SDs, 0 SdLazy, 255 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 243.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 172.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=615occurred in iteration=9, InterpolantAutomatonStates: 52, 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: 38.2ms SsaConstructionTime, 332.0ms SatisfiabilityAnalysisTime, 594.1ms InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...