/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:44:25,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:44:25,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:44:25,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:44:25,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:44:25,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:44:25,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:44:25,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:44:25,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:44:25,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:44:25,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:44:25,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:44:25,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:44:25,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:44:25,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:44:25,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:44:25,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:44:25,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:44:25,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:44:25,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:44:25,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:44:25,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:44:25,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:44:25,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:44:25,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:44:25,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:44:25,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:44:25,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:44:25,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:44:25,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:44:25,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:44:25,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:44:25,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:44:25,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:44:25,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:44:25,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:44:25,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:44:25,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:44:25,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:44:25,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:44:25,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:44:25,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf [2021-03-25 04:44:25,151 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:44:25,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:44:25,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:44:25,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:44:25,154 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:44:25,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:44:25,155 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:44:25,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:44:25,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:44:25,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:44:25,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:44:25,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:44:25,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:44:25,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:44:25,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:44:25,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:44:25,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:44:25,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:44:25,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:44:25,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:44:25,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:44:25,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:44:25,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:44:25,159 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:44:25,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:44:25,159 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:44:25,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:44:25,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:44:25,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:44:25,492 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:44:25,493 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:44:25,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2021-03-25 04:44:25,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ecb6f39/ef449daa6df94d8a8a3c3baebf07265e/FLAG39f92f2cf [2021-03-25 04:44:26,031 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:44:26,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i [2021-03-25 04:44:26,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ecb6f39/ef449daa6df94d8a8a3c3baebf07265e/FLAG39f92f2cf [2021-03-25 04:44:26,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ecb6f39/ef449daa6df94d8a8a3c3baebf07265e [2021-03-25 04:44:26,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:44:26,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:44:26,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:44:26,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:44:26,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:44:26,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:44:26" (1/1) ... [2021-03-25 04:44:26,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c7ea80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:26, skipping insertion in model container [2021-03-25 04:44:26,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:44:26" (1/1) ... [2021-03-25 04:44:26,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:44:26,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:44:26,778 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i[950,963] [2021-03-25 04:44:26,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:44:26,993 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:44:27,006 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt.i[950,963] [2021-03-25 04:44:27,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:44:27,109 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:44:27,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27 WrapperNode [2021-03-25 04:44:27,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:44:27,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:44:27,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:44:27,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:44:27,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:44:27,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:44:27,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:44:27,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:44:27,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... [2021-03-25 04:44:27,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:44:27,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:44:27,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:44:27,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:44:27,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:44:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:44:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:44:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:44:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:44:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:44:27,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:44:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:44:27,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:44:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:44:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:44:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:44:27,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:44:27,279 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:44:28,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:44:28,646 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:44:28,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:44:28 BoogieIcfgContainer [2021-03-25 04:44:28,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:44:28,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:44:28,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:44:28,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:44:28,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:44:26" (1/3) ... [2021-03-25 04:44:28,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd1d0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:44:28, skipping insertion in model container [2021-03-25 04:44:28,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:44:27" (2/3) ... [2021-03-25 04:44:28,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd1d0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:44:28, skipping insertion in model container [2021-03-25 04:44:28,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:44:28" (3/3) ... [2021-03-25 04:44:28,656 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_power.opt.i [2021-03-25 04:44:28,661 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:44:28,665 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:44:28,665 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:44:28,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,693 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,698 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,708 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:44:28,709 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:44:28,724 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 04:44:28,740 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:44:28,741 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:44:28,741 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:44:28,741 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:44:28,741 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:44:28,741 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:44:28,741 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:44:28,741 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:44:28,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 04:44:28,778 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 04:44:28,779 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:28,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 04:44:28,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-03-25 04:44:28,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:28,787 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:28,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:28,797 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:28,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 170 flow [2021-03-25 04:44:28,812 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-03-25 04:44:28,812 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:28,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-25 04:44:28,815 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-25 04:44:29,721 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:44:30,086 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:44:30,194 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:44:31,312 WARN L205 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-03-25 04:44:31,602 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 04:44:32,875 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 04:44:33,457 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 04:44:33,843 INFO L154 LiptonReduction]: Checked pairs total: 1861 [2021-03-25 04:44:33,843 INFO L156 LiptonReduction]: Total number of compositions: 59 [2021-03-25 04:44:33,845 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5059 [2021-03-25 04:44:33,855 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-25 04:44:33,855 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:33,855 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:33,856 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:33,856 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash 511986455, now seen corresponding path program 1 times [2021-03-25 04:44:33,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:33,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053497256] [2021-03-25 04:44:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:34,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:34,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:34,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:34,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:34,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053497256] [2021-03-25 04:44:34,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:34,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:44:34,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738023537] [2021-03-25 04:44:34,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:44:34,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:34,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:44:34,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:44:34,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2021-03-25 04:44:34,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:34,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:34,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2021-03-25 04:44:34,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:34,095 INFO L129 PetriNetUnfolder]: 16/84 cut-off events. [2021-03-25 04:44:34,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:34,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 84 events. 16/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 6 based on Foata normal form. 6/83 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-03-25 04:44:34,096 INFO L132 encePairwiseOnDemand]: 139/143 looper letters, 7 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-25 04:44:34,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 84 flow [2021-03-25 04:44:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:44:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:44:34,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2021-03-25 04:44:34,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8741258741258742 [2021-03-25 04:44:34,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2021-03-25 04:44:34,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2021-03-25 04:44:34,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:34,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2021-03-25 04:44:34,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:34,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:34,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:34,121 INFO L185 Difference]: Start difference. First operand has 36 places, 30 transitions, 66 flow. Second operand 3 states and 375 transitions. [2021-03-25 04:44:34,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 84 flow [2021-03-25 04:44:34,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:34,125 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:34,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2021-03-25 04:44:34,127 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-25 04:44:34,127 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:34,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:34,127 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:34,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 62 flow [2021-03-25 04:44:34,132 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:44:34,132 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:34,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:44:34,133 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 04:44:34,630 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:44:34,988 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:44:35,604 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:44:36,199 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:44:36,770 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:44:36,880 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:44:37,460 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 04:44:37,747 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2021-03-25 04:44:38,964 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 277 DAG size of output: 276 [2021-03-25 04:44:39,564 WARN L205 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 04:44:39,830 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 04:44:39,950 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:44:40,213 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-25 04:44:40,334 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 04:44:40,337 INFO L154 LiptonReduction]: Checked pairs total: 748 [2021-03-25 04:44:40,338 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 04:44:40,338 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6211 [2021-03-25 04:44:40,339 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-25 04:44:40,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:40,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:40,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:44:40,340 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1652750832, now seen corresponding path program 1 times [2021-03-25 04:44:40,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:40,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340772865] [2021-03-25 04:44:40,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:40,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:40,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:40,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:40,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:40,438 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:44:40,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:44:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:40,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340772865] [2021-03-25 04:44:40,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:40,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:40,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731751634] [2021-03-25 04:44:40,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:40,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:40,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 153 [2021-03-25 04:44:40,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:40,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 153 [2021-03-25 04:44:40,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:40,481 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-25 04:44:40,481 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:40,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 21 events. 1/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2021-03-25 04:44:40,482 INFO L132 encePairwiseOnDemand]: 149/153 looper letters, 1 selfloop transitions, 2 changer transitions 4/20 dead transitions. [2021-03-25 04:44:40,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 20 transitions, 60 flow [2021-03-25 04:44:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2021-03-25 04:44:40,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8457516339869281 [2021-03-25 04:44:40,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2021-03-25 04:44:40,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2021-03-25 04:44:40,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:40,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2021-03-25 04:44:40,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,500 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,500 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 647 transitions. [2021-03-25 04:44:40,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 20 transitions, 60 flow [2021-03-25 04:44:40,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:40,501 INFO L241 Difference]: Finished difference. Result has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:40,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2021-03-25 04:44:40,501 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -8 predicate places. [2021-03-25 04:44:40,502 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:40,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:40,502 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 44 flow [2021-03-25 04:44:40,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2021-03-25 04:44:40,505 INFO L129 PetriNetUnfolder]: 0/16 cut-off events. [2021-03-25 04:44:40,505 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:44:40,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:44:40,506 INFO L142 LiptonReduction]: Number of co-enabled transitions 106 [2021-03-25 04:44:40,616 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-25 04:44:40,616 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:44:40,616 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-03-25 04:44:40,617 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 04:44:40,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:40,617 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:40,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:44:40,618 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash 268361190, now seen corresponding path program 1 times [2021-03-25 04:44:40,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:40,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696153903] [2021-03-25 04:44:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:40,805 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-03-25 04:44:40,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:44:40,838 INFO L142 QuantifierPusher]: treesize reduction 26, result has 52.7 percent of original size [2021-03-25 04:44:40,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 04:44:40,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:40,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:44:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:40,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696153903] [2021-03-25 04:44:40,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:40,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:40,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242331728] [2021-03-25 04:44:40,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:44:40,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:40,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:44:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:44:40,871 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 154 [2021-03-25 04:44:40,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:40,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 154 [2021-03-25 04:44:40,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:40,944 INFO L129 PetriNetUnfolder]: 21/61 cut-off events. [2021-03-25 04:44:40,945 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 04:44:40,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 61 events. 21/61 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 183 event pairs, 13 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 121. Up to 40 conditions per place. [2021-03-25 04:44:40,946 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 8 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2021-03-25 04:44:40,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 83 flow [2021-03-25 04:44:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:44:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:44:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2021-03-25 04:44:40,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75 [2021-03-25 04:44:40,949 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2021-03-25 04:44:40,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2021-03-25 04:44:40,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:40,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2021-03-25 04:44:40,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,952 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,952 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 462 transitions. [2021-03-25 04:44:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 83 flow [2021-03-25 04:44:40,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:40,953 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:40,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-03-25 04:44:40,954 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2021-03-25 04:44:40,955 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:40,955 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:40,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:40,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:40,966 INFO L129 PetriNetUnfolder]: 3/24 cut-off events. [2021-03-25 04:44:40,966 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2021-03-25 04:44:40,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 24 events. 3/24 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2021-03-25 04:44:40,967 INFO L142 LiptonReduction]: Number of co-enabled transitions 104 [2021-03-25 04:44:40,968 INFO L154 LiptonReduction]: Checked pairs total: 117 [2021-03-25 04:44:40,968 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:40,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 04:44:40,969 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 71 flow [2021-03-25 04:44:40,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:40,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:40,972 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:40,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:44:40,972 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 874280525, now seen corresponding path program 1 times [2021-03-25 04:44:40,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:40,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928336201] [2021-03-25 04:44:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:41,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:41,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:41,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:41,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:44:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:41,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928336201] [2021-03-25 04:44:41,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:41,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:41,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651256906] [2021-03-25 04:44:41,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:44:41,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:44:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:44:41,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 154 [2021-03-25 04:44:41,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:41,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 154 [2021-03-25 04:44:41,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:41,142 INFO L129 PetriNetUnfolder]: 20/64 cut-off events. [2021-03-25 04:44:41,143 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-03-25 04:44:41,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 64 events. 20/64 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 7 based on Foata normal form. 2/65 useless extension candidates. Maximal degree in co-relation 150. Up to 33 conditions per place. [2021-03-25 04:44:41,144 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 9 selfloop transitions, 6 changer transitions 0/23 dead transitions. [2021-03-25 04:44:41,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 114 flow [2021-03-25 04:44:41,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:44:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:44:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2021-03-25 04:44:41,146 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8051948051948052 [2021-03-25 04:44:41,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2021-03-25 04:44:41,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2021-03-25 04:44:41,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:41,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2021-03-25 04:44:41,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,149 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,149 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 71 flow. Second operand 4 states and 496 transitions. [2021-03-25 04:44:41,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 114 flow [2021-03-25 04:44:41,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 23 transitions, 114 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:44:41,150 INFO L241 Difference]: Finished difference. Result has 30 places, 21 transitions, 100 flow [2021-03-25 04:44:41,151 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2021-03-25 04:44:41,151 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2021-03-25 04:44:41,151 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:41,151 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 100 flow [2021-03-25 04:44:41,151 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 100 flow [2021-03-25 04:44:41,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 100 flow [2021-03-25 04:44:41,155 INFO L129 PetriNetUnfolder]: 6/33 cut-off events. [2021-03-25 04:44:41,156 INFO L130 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2021-03-25 04:44:41,156 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 33 events. 6/33 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 77. Up to 13 conditions per place. [2021-03-25 04:44:41,156 INFO L142 LiptonReduction]: Number of co-enabled transitions 108 [2021-03-25 04:44:41,157 INFO L154 LiptonReduction]: Checked pairs total: 107 [2021-03-25 04:44:41,157 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:41,158 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 04:44:41,158 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 100 flow [2021-03-25 04:44:41,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,159 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:41,159 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:41,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:44:41,159 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash 911923391, now seen corresponding path program 1 times [2021-03-25 04:44:41,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:41,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22033138] [2021-03-25 04:44:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:41,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:41,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:41,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:41,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22033138] [2021-03-25 04:44:41,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:41,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:41,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060930504] [2021-03-25 04:44:41,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:41,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:41,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 154 [2021-03-25 04:44:41,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:41,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 154 [2021-03-25 04:44:41,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:41,249 INFO L129 PetriNetUnfolder]: 13/56 cut-off events. [2021-03-25 04:44:41,249 INFO L130 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2021-03-25 04:44:41,249 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 56 events. 13/56 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 180 event pairs, 4 based on Foata normal form. 6/60 useless extension candidates. Maximal degree in co-relation 134. Up to 22 conditions per place. [2021-03-25 04:44:41,250 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 4 selfloop transitions, 5 changer transitions 3/28 dead transitions. [2021-03-25 04:44:41,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 138 flow [2021-03-25 04:44:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:44:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:44:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2021-03-25 04:44:41,252 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8558441558441559 [2021-03-25 04:44:41,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2021-03-25 04:44:41,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2021-03-25 04:44:41,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:41,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2021-03-25 04:44:41,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 154.0) internal successors, (924), 6 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,256 INFO L185 Difference]: Start difference. First operand has 30 places, 21 transitions, 100 flow. Second operand 5 states and 659 transitions. [2021-03-25 04:44:41,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 138 flow [2021-03-25 04:44:41,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 129 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:44:41,257 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 128 flow [2021-03-25 04:44:41,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 04:44:41,258 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2021-03-25 04:44:41,258 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:41,258 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 128 flow [2021-03-25 04:44:41,258 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 128 flow [2021-03-25 04:44:41,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 128 flow [2021-03-25 04:44:41,265 INFO L129 PetriNetUnfolder]: 9/51 cut-off events. [2021-03-25 04:44:41,265 INFO L130 PetriNetUnfolder]: For 37/40 co-relation queries the response was YES. [2021-03-25 04:44:41,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 51 events. 9/51 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 2 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 136. Up to 15 conditions per place. [2021-03-25 04:44:41,266 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 04:44:41,267 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-25 04:44:41,267 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:44:41,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 04:44:41,268 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 128 flow [2021-03-25 04:44:41,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:41,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:41,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:44:41,269 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1798004884, now seen corresponding path program 1 times [2021-03-25 04:44:41,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:41,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812852652] [2021-03-25 04:44:41,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:41,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:41,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:41,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:44:41,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:41,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:41,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812852652] [2021-03-25 04:44:41,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:41,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:44:41,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284272663] [2021-03-25 04:44:41,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:44:41,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:44:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:44:41,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 154 [2021-03-25 04:44:41,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:41,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 154 [2021-03-25 04:44:41,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:41,398 INFO L129 PetriNetUnfolder]: 5/38 cut-off events. [2021-03-25 04:44:41,398 INFO L130 PetriNetUnfolder]: For 39/54 co-relation queries the response was YES. [2021-03-25 04:44:41,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 38 events. 5/38 cut-off events. For 39/54 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 86 event pairs, 0 based on Foata normal form. 20/58 useless extension candidates. Maximal degree in co-relation 112. Up to 14 conditions per place. [2021-03-25 04:44:41,399 INFO L132 encePairwiseOnDemand]: 149/154 looper letters, 2 selfloop transitions, 8 changer transitions 2/28 dead transitions. [2021-03-25 04:44:41,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 166 flow [2021-03-25 04:44:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:44:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:44:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2021-03-25 04:44:41,402 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8506493506493507 [2021-03-25 04:44:41,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2021-03-25 04:44:41,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2021-03-25 04:44:41,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:41,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2021-03-25 04:44:41,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,407 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:41,407 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 128 flow. Second operand 7 states and 917 transitions. [2021-03-25 04:44:41,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 166 flow [2021-03-25 04:44:41,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 28 transitions, 157 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:44:41,409 INFO L241 Difference]: Finished difference. Result has 43 places, 26 transitions, 152 flow [2021-03-25 04:44:41,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2021-03-25 04:44:41,409 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-03-25 04:44:41,409 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:41,409 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 26 transitions, 152 flow [2021-03-25 04:44:41,410 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 26 transitions, 152 flow [2021-03-25 04:44:41,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 26 transitions, 152 flow [2021-03-25 04:44:41,414 INFO L129 PetriNetUnfolder]: 4/35 cut-off events. [2021-03-25 04:44:41,415 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2021-03-25 04:44:41,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 35 events. 4/35 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 104. Up to 12 conditions per place. [2021-03-25 04:44:41,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 04:44:41,681 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:44:41,812 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 04:44:42,469 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 191 [2021-03-25 04:44:42,719 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 04:44:44,112 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 346 DAG size of output: 267 [2021-03-25 04:44:44,626 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 04:44:44,630 INFO L154 LiptonReduction]: Checked pairs total: 130 [2021-03-25 04:44:44,630 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 04:44:44,630 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3221 [2021-03-25 04:44:44,631 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 132 flow [2021-03-25 04:44:44,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,631 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:44,631 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:44,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:44:44,631 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash 976792138, now seen corresponding path program 1 times [2021-03-25 04:44:44,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:44,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604419508] [2021-03-25 04:44:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:44:44,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:44,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:44:44,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:44,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:44,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:44:44,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:44:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:44:44,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604419508] [2021-03-25 04:44:44,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:44:44,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:44:44,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127293348] [2021-03-25 04:44:44,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:44:44,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:44:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:44:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:44:44,725 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 156 [2021-03-25 04:44:44,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:44:44,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 156 [2021-03-25 04:44:44,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:44:44,749 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-25 04:44:44,750 INFO L130 PetriNetUnfolder]: For 90/91 co-relation queries the response was YES. [2021-03-25 04:44:44,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 41 events. 7/41 cut-off events. For 90/91 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 106 event pairs, 0 based on Foata normal form. 2/43 useless extension candidates. Maximal degree in co-relation 123. Up to 12 conditions per place. [2021-03-25 04:44:44,750 INFO L132 encePairwiseOnDemand]: 153/156 looper letters, 3 selfloop transitions, 1 changer transitions 3/22 dead transitions. [2021-03-25 04:44:44,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 22 transitions, 135 flow [2021-03-25 04:44:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:44:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:44:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2021-03-25 04:44:44,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8237179487179487 [2021-03-25 04:44:44,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2021-03-25 04:44:44,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2021-03-25 04:44:44,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:44:44,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2021-03-25 04:44:44,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,755 INFO L185 Difference]: Start difference. First operand has 40 places, 22 transitions, 132 flow. Second operand 4 states and 514 transitions. [2021-03-25 04:44:44,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 22 transitions, 135 flow [2021-03-25 04:44:44,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 112 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-25 04:44:44,759 INFO L241 Difference]: Finished difference. Result has 34 places, 19 transitions, 96 flow [2021-03-25 04:44:44,759 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2021-03-25 04:44:44,760 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-03-25 04:44:44,760 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:44:44,760 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 19 transitions, 96 flow [2021-03-25 04:44:44,760 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 19 transitions, 96 flow [2021-03-25 04:44:44,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 96 flow [2021-03-25 04:44:44,766 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2021-03-25 04:44:44,766 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 04:44:44,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 26 events. 3/26 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 65. Up to 7 conditions per place. [2021-03-25 04:44:44,767 INFO L142 LiptonReduction]: Number of co-enabled transitions 18 [2021-03-25 04:44:44,956 INFO L154 LiptonReduction]: Checked pairs total: 19 [2021-03-25 04:44:44,956 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:44:44,957 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 197 [2021-03-25 04:44:44,957 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 95 flow [2021-03-25 04:44:44,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:44:44,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:44:44,958 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:44:44,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:44:44,958 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:44:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:44:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash -334541634, now seen corresponding path program 1 times [2021-03-25 04:44:44,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:44:44,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384102420] [2021-03-25 04:44:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:44:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:44:44,986 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:44:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:44:45,012 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:44:45,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:44:45,044 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:44:45,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:44:45,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:44:45 BasicIcfg [2021-03-25 04:44:45,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:44:45,122 INFO L168 Benchmark]: Toolchain (without parser) took 18545.49 ms. Allocated memory was 323.0 MB in the beginning and 595.6 MB in the end (delta: 272.6 MB). Free memory was 285.6 MB in the beginning and 421.2 MB in the end (delta: -135.6 MB). Peak memory consumption was 137.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,123 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 323.0 MB. Free memory was 304.3 MB in the beginning and 304.2 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:44:45,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 532.84 ms. Allocated memory is still 323.0 MB. Free memory was 285.3 MB in the beginning and 281.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.39 ms. Allocated memory is still 323.0 MB. Free memory was 281.7 MB in the beginning and 279.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,124 INFO L168 Benchmark]: Boogie Preprocessor took 34.42 ms. Allocated memory is still 323.0 MB. Free memory was 279.6 MB in the beginning and 277.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,124 INFO L168 Benchmark]: RCFGBuilder took 1442.01 ms. Allocated memory is still 323.0 MB. Free memory was 277.5 MB in the beginning and 260.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,125 INFO L168 Benchmark]: TraceAbstraction took 16468.91 ms. Allocated memory was 323.0 MB in the beginning and 595.6 MB in the end (delta: 272.6 MB). Free memory was 260.3 MB in the beginning and 421.2 MB in the end (delta: -160.9 MB). Peak memory consumption was 111.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:44:45,126 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.48 ms. Allocated memory is still 323.0 MB. Free memory was 304.3 MB in the beginning and 304.2 MB in the end (delta: 125.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 532.84 ms. Allocated memory is still 323.0 MB. Free memory was 285.3 MB in the beginning and 281.7 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.39 ms. Allocated memory is still 323.0 MB. Free memory was 281.7 MB in the beginning and 279.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.42 ms. Allocated memory is still 323.0 MB. Free memory was 279.6 MB in the beginning and 277.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1442.01 ms. Allocated memory is still 323.0 MB. Free memory was 277.5 MB in the beginning and 260.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16468.91 ms. Allocated memory was 323.0 MB in the beginning and 595.6 MB in the end (delta: 272.6 MB). Free memory was 260.3 MB in the beginning and 421.2 MB in the end (delta: -160.9 MB). Peak memory consumption was 111.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5046.8ms, 87 PlacesBefore, 36 PlacesAfterwards, 82 TransitionsBefore, 30 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 59 TotalNumberOfCompositions, 1861 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 835, positive: 771, positive conditional: 0, positive unconditional: 771, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 500, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 500, positive: 477, positive conditional: 0, positive unconditional: 477, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 835, positive: 294, positive conditional: 0, positive unconditional: 294, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 500, unknown conditional: 0, unknown unconditional: 500] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6210.3ms, 34 PlacesBefore, 25 PlacesAfterwards, 27 TransitionsBefore, 18 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 4 FixpointIterations, 5 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 748 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 240, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.8ms, 28 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 77, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.7ms, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 52, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1ms, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 51, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 33, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3220.3ms, 43 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 22 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 67, positive conditional: 0, positive unconditional: 67, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 85, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 22, Positive conditional cache size: 0, Positive unconditional cache size: 22, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 196.4ms, 34 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 17 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16308.0ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 405.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5109.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24 SDtfs, 12 SDslu, 8 SDs, 0 SdLazy, 98 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 118.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 148.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=6, InterpolantAutomatonStates: 32, 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: 26.8ms SsaConstructionTime, 291.2ms SatisfiabilityAnalysisTime, 494.3ms InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...