/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:51:04,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:51:04,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:51:04,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:51:04,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:51:04,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:51:04,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:51:04,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:51:04,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:51:04,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:51:04,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:51:04,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:51:04,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:51:04,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:51:04,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:51:04,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:51:04,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:51:04,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:51:04,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:51:04,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:51:04,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:51:04,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:51:04,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:51:04,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:51:04,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:51:04,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:51:04,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:51:04,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:51:04,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:51:04,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:51:04,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:51:04,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:51:04,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:51:04,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:51:04,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:51:04,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:51:04,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:51:04,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:51:04,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:51:04,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:51:04,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:51:04,066 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-SemanticLbe-SemanticLooper.epf [2020-10-16 04:51:04,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:51:04,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:51:04,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:51:04,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:51:04,091 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:51:04,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:51:04,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:51:04,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:51:04,092 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:51:04,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:51:04,093 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:51:04,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:51:04,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:51:04,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:51:04,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:51:04,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:51:04,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:51:04,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:51:04,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:51:04,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:51:04,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:51:04,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:51:04,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:51:04,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:51:04,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:51:04,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:51:04,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:51:04,449 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:51:04,450 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:51:04,451 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2020-10-16 04:51:04,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6475f/85beec1e76ec4d70b34aad365cd8a454/FLAG73db5c27d [2020-10-16 04:51:05,061 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:51:05,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2020-10-16 04:51:05,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6475f/85beec1e76ec4d70b34aad365cd8a454/FLAG73db5c27d [2020-10-16 04:51:05,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7c6475f/85beec1e76ec4d70b34aad365cd8a454 [2020-10-16 04:51:05,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:51:05,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:51:05,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:05,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:51:05,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:51:05,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:05" (1/1) ... [2020-10-16 04:51:05,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd63d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:05, skipping insertion in model container [2020-10-16 04:51:05,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:51:05" (1/1) ... [2020-10-16 04:51:05,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:51:05,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:51:05,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:05,995 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:51:06,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:51:06,154 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:51:06,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06 WrapperNode [2020-10-16 04:51:06,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:51:06,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:06,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:51:06,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:51:06,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:51:06,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:51:06,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:51:06,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:51:06,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (1/1) ... [2020-10-16 04:51:06,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:51:06,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:51:06,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:51:06,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:51:06,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (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 [2020-10-16 04:51:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:51:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:51:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:51:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:51:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:51:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:51:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:51:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:51:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:51:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:51:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:51:06,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:51:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:51:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:51:06,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:51:06,331 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:51:08,262 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:51:08,263 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:51:08,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:08 BoogieIcfgContainer [2020-10-16 04:51:08,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:51:08,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:51:08,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:51:08,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:51:08,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:51:05" (1/3) ... [2020-10-16 04:51:08,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ee4b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:08, skipping insertion in model container [2020-10-16 04:51:08,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:51:06" (2/3) ... [2020-10-16 04:51:08,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ee4b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:51:08, skipping insertion in model container [2020-10-16 04:51:08,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:51:08" (3/3) ... [2020-10-16 04:51:08,274 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2020-10-16 04:51:08,286 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:51:08,294 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:51:08,295 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:51:08,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,328 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,328 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,333 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,333 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,333 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,334 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,336 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,348 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,351 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,353 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:51:08,373 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:51:08,395 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:51:08,395 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:51:08,395 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:51:08,395 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:51:08,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:51:08,396 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:51:08,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:51:08,396 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:51:08,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 04:51:08,464 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 04:51:08,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:08,470 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:51:08,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2020-10-16 04:51:08,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:08,483 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:51:08,486 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:08,489 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:08,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2020-10-16 04:51:08,524 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-16 04:51:08,525 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:08,526 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:51:08,531 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 04:51:08,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:08,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:08,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:08,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:08,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:08,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:08,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:08,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:08,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:08,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:08,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:08,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:08,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:09,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:09,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:51:09,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:09,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:09,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,368 WARN L193 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 04:51:10,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 04:51:10,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:10,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:51:10,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:11,666 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 04:51:11,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:11,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:11,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:11,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:11,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:11,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:11,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:11,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:11,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:11,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:51:11,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:12,179 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 04:51:12,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:12,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:12,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:12,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:12,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:12,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:12,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:12,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:12,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:12,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:12,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:12,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:12,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:12,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:12,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:51:12,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:51:12,949 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 04:51:13,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:13,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:13,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:13,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:13,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:13,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:13,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:13,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:13,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:13,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:13,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:14,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:51:14,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:14,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:14,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:14,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-16 04:51:14,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:14,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:14,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:51:14,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:51:14,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:51:14,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:51:14,962 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-16 04:51:15,083 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-16 04:51:15,109 INFO L132 LiptonReduction]: Checked pairs total: 6368 [2020-10-16 04:51:15,109 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 04:51:15,112 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6632 [2020-10-16 04:51:15,127 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 04:51:15,127 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:15,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:15,128 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:15,129 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1444069344, now seen corresponding path program 1 times [2020-10-16 04:51:15,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:15,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333118862] [2020-10-16 04:51:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:15,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333118862] [2020-10-16 04:51:15,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:15,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:51:15,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767176726] [2020-10-16 04:51:15,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:51:15,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:15,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:51:15,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:51:15,422 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 205 [2020-10-16 04:51:15,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:51:15,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:15,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 205 [2020-10-16 04:51:15,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:15,497 INFO L129 PetriNetUnfolder]: 16/74 cut-off events. [2020-10-16 04:51:15,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:51:15,498 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 74 events. 16/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 244 event pairs, 2 based on Foata normal form. 6/78 useless extension candidates. Maximal degree in co-relation 111. Up to 27 conditions per place. [2020-10-16 04:51:15,500 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 04:51:15,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 04:51:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:51:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:51:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2020-10-16 04:51:15,520 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8878048780487805 [2020-10-16 04:51:15,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2020-10-16 04:51:15,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2020-10-16 04:51:15,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:15,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2020-10-16 04:51:15,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:51:15,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:51:15,540 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:51:15,542 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 546 transitions. [2020-10-16 04:51:15,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 04:51:15,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:15,549 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 04:51:15,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:51:15,553 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:51:15,553 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 04:51:15,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:51:15,553 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:15,554 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:15,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:51:15,554 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1875609895, now seen corresponding path program 1 times [2020-10-16 04:51:15,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:15,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799493593] [2020-10-16 04:51:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:15,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799493593] [2020-10-16 04:51:15,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:15,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:51:15,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336133926] [2020-10-16 04:51:15,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:15,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:15,800 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 205 [2020-10-16 04:51:15,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 04:51:15,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:15,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 205 [2020-10-16 04:51:15,802 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:15,963 INFO L129 PetriNetUnfolder]: 48/128 cut-off events. [2020-10-16 04:51:15,964 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 04:51:15,964 INFO L80 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 128 events. 48/128 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 528 event pairs, 17 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 237. Up to 64 conditions per place. [2020-10-16 04:51:15,966 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 8 selfloop transitions, 2 changer transitions 9/38 dead transitions. [2020-10-16 04:51:15,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 128 flow [2020-10-16 04:51:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2020-10-16 04:51:15,970 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7863414634146342 [2020-10-16 04:51:15,970 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2020-10-16 04:51:15,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2020-10-16 04:51:15,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:15,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2020-10-16 04:51:15,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:15,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:15,976 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:15,976 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 806 transitions. [2020-10-16 04:51:15,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 128 flow [2020-10-16 04:51:15,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:15,978 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 74 flow [2020-10-16 04:51:15,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 04:51:15,979 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:51:15,979 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 74 flow [2020-10-16 04:51:15,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:15,979 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:15,979 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:15,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:51:15,980 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1973183834, now seen corresponding path program 1 times [2020-10-16 04:51:15,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:15,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982163256] [2020-10-16 04:51:15,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982163256] [2020-10-16 04:51:16,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:16,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387105596] [2020-10-16 04:51:16,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:16,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:16,122 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 205 [2020-10-16 04:51:16,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states. [2020-10-16 04:51:16,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 205 [2020-10-16 04:51:16,123 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,187 INFO L129 PetriNetUnfolder]: 2/39 cut-off events. [2020-10-16 04:51:16,187 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 04:51:16,188 INFO L80 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 39 events. 2/39 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 2/40 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2020-10-16 04:51:16,188 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 5 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 04:51:16,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 30 transitions, 100 flow [2020-10-16 04:51:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2020-10-16 04:51:16,192 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8058536585365854 [2020-10-16 04:51:16,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2020-10-16 04:51:16,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2020-10-16 04:51:16,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:16,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2020-10-16 04:51:16,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:16,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:16,198 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:16,199 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 74 flow. Second operand 5 states and 826 transitions. [2020-10-16 04:51:16,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 30 transitions, 100 flow [2020-10-16 04:51:16,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 92 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:16,201 INFO L241 Difference]: Finished difference. Result has 44 places, 27 transitions, 78 flow [2020-10-16 04:51:16,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=5, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2020-10-16 04:51:16,201 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:51:16,201 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 78 flow [2020-10-16 04:51:16,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:16,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:16,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:16,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:51:16,202 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1426112121, now seen corresponding path program 1 times [2020-10-16 04:51:16,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:16,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513008353] [2020-10-16 04:51:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513008353] [2020-10-16 04:51:16,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:16,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787530407] [2020-10-16 04:51:16,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:16,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:16,396 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:16,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 78 flow. Second operand 6 states. [2020-10-16 04:51:16,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:16,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,550 INFO L129 PetriNetUnfolder]: 28/99 cut-off events. [2020-10-16 04:51:16,551 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-16 04:51:16,554 INFO L80 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 99 events. 28/99 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 18 based on Foata normal form. 6/102 useless extension candidates. Maximal degree in co-relation 200. Up to 50 conditions per place. [2020-10-16 04:51:16,555 INFO L132 encePairwiseOnDemand]: 199/205 looper letters, 9 selfloop transitions, 5 changer transitions 6/39 dead transitions. [2020-10-16 04:51:16,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 147 flow [2020-10-16 04:51:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:51:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:51:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 958 transitions. [2020-10-16 04:51:16,561 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7788617886178861 [2020-10-16 04:51:16,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 958 transitions. [2020-10-16 04:51:16,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 958 transitions. [2020-10-16 04:51:16,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:16,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 958 transitions. [2020-10-16 04:51:16,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:51:16,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:51:16,568 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:51:16,569 INFO L185 Difference]: Start difference. First operand has 44 places, 27 transitions, 78 flow. Second operand 6 states and 958 transitions. [2020-10-16 04:51:16,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 147 flow [2020-10-16 04:51:16,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 132 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 04:51:16,573 INFO L241 Difference]: Finished difference. Result has 46 places, 31 transitions, 104 flow [2020-10-16 04:51:16,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2020-10-16 04:51:16,574 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 04:51:16,574 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 104 flow [2020-10-16 04:51:16,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:16,574 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:16,575 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:16,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:51:16,575 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1821870961, now seen corresponding path program 1 times [2020-10-16 04:51:16,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:16,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131441485] [2020-10-16 04:51:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:16,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131441485] [2020-10-16 04:51:16,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:16,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:16,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480049187] [2020-10-16 04:51:16,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:16,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:16,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:16,788 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 205 [2020-10-16 04:51:16,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 104 flow. Second operand 7 states. [2020-10-16 04:51:16,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:16,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 205 [2020-10-16 04:51:16,790 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:16,993 INFO L129 PetriNetUnfolder]: 31/105 cut-off events. [2020-10-16 04:51:16,993 INFO L130 PetriNetUnfolder]: For 71/75 co-relation queries the response was YES. [2020-10-16 04:51:16,994 INFO L80 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 105 events. 31/105 cut-off events. For 71/75 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 388 event pairs, 8 based on Foata normal form. 10/115 useless extension candidates. Maximal degree in co-relation 251. Up to 44 conditions per place. [2020-10-16 04:51:16,995 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 11 selfloop transitions, 9 changer transitions 8/47 dead transitions. [2020-10-16 04:51:16,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 226 flow [2020-10-16 04:51:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:51:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:51:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1275 transitions. [2020-10-16 04:51:17,000 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7774390243902439 [2020-10-16 04:51:17,000 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1275 transitions. [2020-10-16 04:51:17,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1275 transitions. [2020-10-16 04:51:17,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:17,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1275 transitions. [2020-10-16 04:51:17,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:51:17,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:51:17,008 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:51:17,008 INFO L185 Difference]: Start difference. First operand has 46 places, 31 transitions, 104 flow. Second operand 8 states and 1275 transitions. [2020-10-16 04:51:17,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 226 flow [2020-10-16 04:51:17,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 222 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:17,011 INFO L241 Difference]: Finished difference. Result has 55 places, 36 transitions, 165 flow [2020-10-16 04:51:17,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2020-10-16 04:51:17,012 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2020-10-16 04:51:17,012 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 165 flow [2020-10-16 04:51:17,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:17,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:17,012 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:17,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:51:17,013 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:17,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash 398262842, now seen corresponding path program 1 times [2020-10-16 04:51:17,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:17,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634396971] [2020-10-16 04:51:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:17,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634396971] [2020-10-16 04:51:17,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:17,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:51:17,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820648801] [2020-10-16 04:51:17,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:51:17,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:17,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:51:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:51:17,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:17,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 165 flow. Second operand 4 states. [2020-10-16 04:51:17,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:17,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:17,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:17,219 INFO L129 PetriNetUnfolder]: 187/402 cut-off events. [2020-10-16 04:51:17,219 INFO L130 PetriNetUnfolder]: For 512/556 co-relation queries the response was YES. [2020-10-16 04:51:17,222 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 402 events. 187/402 cut-off events. For 512/556 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2436 event pairs, 93 based on Foata normal form. 29/379 useless extension candidates. Maximal degree in co-relation 1073. Up to 214 conditions per place. [2020-10-16 04:51:17,226 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2020-10-16 04:51:17,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 231 flow [2020-10-16 04:51:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2020-10-16 04:51:17,230 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8507317073170731 [2020-10-16 04:51:17,230 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2020-10-16 04:51:17,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2020-10-16 04:51:17,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:17,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2020-10-16 04:51:17,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:17,235 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:17,235 INFO L185 Difference]: Start difference. First operand has 55 places, 36 transitions, 165 flow. Second operand 5 states and 872 transitions. [2020-10-16 04:51:17,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 231 flow [2020-10-16 04:51:17,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 216 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 04:51:17,241 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 225 flow [2020-10-16 04:51:17,241 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2020-10-16 04:51:17,242 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2020-10-16 04:51:17,242 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 225 flow [2020-10-16 04:51:17,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:51:17,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:17,242 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:17,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:51:17,243 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 921334376, now seen corresponding path program 1 times [2020-10-16 04:51:17,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:17,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123028019] [2020-10-16 04:51:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:17,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123028019] [2020-10-16 04:51:17,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:17,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:17,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750095459] [2020-10-16 04:51:17,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:17,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:17,322 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:17,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 225 flow. Second operand 5 states. [2020-10-16 04:51:17,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:17,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:17,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:17,446 INFO L129 PetriNetUnfolder]: 159/356 cut-off events. [2020-10-16 04:51:17,446 INFO L130 PetriNetUnfolder]: For 476/1032 co-relation queries the response was YES. [2020-10-16 04:51:17,450 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 356 events. 159/356 cut-off events. For 476/1032 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1900 event pairs, 32 based on Foata normal form. 80/398 useless extension candidates. Maximal degree in co-relation 1313. Up to 238 conditions per place. [2020-10-16 04:51:17,453 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 19 changer transitions 0/58 dead transitions. [2020-10-16 04:51:17,453 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 359 flow [2020-10-16 04:51:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:51:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:51:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2020-10-16 04:51:17,458 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8508710801393728 [2020-10-16 04:51:17,458 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1221 transitions. [2020-10-16 04:51:17,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1221 transitions. [2020-10-16 04:51:17,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:17,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1221 transitions. [2020-10-16 04:51:17,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:51:17,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:51:17,465 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:51:17,465 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 225 flow. Second operand 7 states and 1221 transitions. [2020-10-16 04:51:17,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 359 flow [2020-10-16 04:51:17,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:51:17,469 INFO L241 Difference]: Finished difference. Result has 63 places, 54 transitions, 354 flow [2020-10-16 04:51:17,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2020-10-16 04:51:17,470 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2020-10-16 04:51:17,470 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 354 flow [2020-10-16 04:51:17,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:17,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:17,471 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:17,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:51:17,471 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:17,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:17,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1201652393, now seen corresponding path program 1 times [2020-10-16 04:51:17,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:17,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98044649] [2020-10-16 04:51:17,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:17,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98044649] [2020-10-16 04:51:17,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:17,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:51:17,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511370344] [2020-10-16 04:51:17,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:51:17,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:51:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:51:17,543 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 205 [2020-10-16 04:51:17,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 354 flow. Second operand 5 states. [2020-10-16 04:51:17,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:17,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 205 [2020-10-16 04:51:17,545 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:17,708 INFO L129 PetriNetUnfolder]: 329/709 cut-off events. [2020-10-16 04:51:17,709 INFO L130 PetriNetUnfolder]: For 2402/3465 co-relation queries the response was YES. [2020-10-16 04:51:17,715 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 709 events. 329/709 cut-off events. For 2402/3465 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4660 event pairs, 67 based on Foata normal form. 31/664 useless extension candidates. Maximal degree in co-relation 3158. Up to 457 conditions per place. [2020-10-16 04:51:17,722 INFO L132 encePairwiseOnDemand]: 201/205 looper letters, 7 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2020-10-16 04:51:17,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 404 flow [2020-10-16 04:51:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:51:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:51:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2020-10-16 04:51:17,726 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8448780487804878 [2020-10-16 04:51:17,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2020-10-16 04:51:17,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2020-10-16 04:51:17,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:17,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2020-10-16 04:51:17,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:51:17,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:51:17,732 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:51:17,732 INFO L185 Difference]: Start difference. First operand has 63 places, 54 transitions, 354 flow. Second operand 5 states and 866 transitions. [2020-10-16 04:51:17,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 404 flow [2020-10-16 04:51:17,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 354 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 04:51:17,748 INFO L241 Difference]: Finished difference. Result has 67 places, 56 transitions, 333 flow [2020-10-16 04:51:17,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2020-10-16 04:51:17,749 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2020-10-16 04:51:17,749 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 333 flow [2020-10-16 04:51:17,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:51:17,749 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:17,750 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:17,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:51:17,750 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:17,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2002224189, now seen corresponding path program 2 times [2020-10-16 04:51:17,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:17,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980907690] [2020-10-16 04:51:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:17,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980907690] [2020-10-16 04:51:17,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:17,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:51:17,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857492622] [2020-10-16 04:51:17,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:51:17,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:51:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:51:17,856 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:17,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 333 flow. Second operand 6 states. [2020-10-16 04:51:17,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:17,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:17,857 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:18,073 INFO L129 PetriNetUnfolder]: 226/509 cut-off events. [2020-10-16 04:51:18,073 INFO L130 PetriNetUnfolder]: For 2110/3531 co-relation queries the response was YES. [2020-10-16 04:51:18,078 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2431 conditions, 509 events. 226/509 cut-off events. For 2110/3531 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3092 event pairs, 10 based on Foata normal form. 224/676 useless extension candidates. Maximal degree in co-relation 2404. Up to 311 conditions per place. [2020-10-16 04:51:18,081 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 28 changer transitions 4/69 dead transitions. [2020-10-16 04:51:18,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 535 flow [2020-10-16 04:51:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:51:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:51:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1570 transitions. [2020-10-16 04:51:18,087 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8509485094850948 [2020-10-16 04:51:18,087 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1570 transitions. [2020-10-16 04:51:18,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1570 transitions. [2020-10-16 04:51:18,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:18,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1570 transitions. [2020-10-16 04:51:18,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:51:18,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:51:18,095 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:51:18,095 INFO L185 Difference]: Start difference. First operand has 67 places, 56 transitions, 333 flow. Second operand 9 states and 1570 transitions. [2020-10-16 04:51:18,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 535 flow [2020-10-16 04:51:18,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 69 transitions, 525 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 04:51:18,133 INFO L241 Difference]: Finished difference. Result has 76 places, 65 transitions, 501 flow [2020-10-16 04:51:18,134 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2020-10-16 04:51:18,134 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2020-10-16 04:51:18,134 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 501 flow [2020-10-16 04:51:18,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:51:18,135 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:18,135 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:18,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:51:18,135 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash 270621049, now seen corresponding path program 1 times [2020-10-16 04:51:18,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:18,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740069963] [2020-10-16 04:51:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:18,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740069963] [2020-10-16 04:51:18,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:18,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:51:18,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516280584] [2020-10-16 04:51:18,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:51:18,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:51:18,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:51:18,226 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2020-10-16 04:51:18,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 501 flow. Second operand 7 states. [2020-10-16 04:51:18,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:18,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2020-10-16 04:51:18,227 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:18,414 INFO L129 PetriNetUnfolder]: 190/428 cut-off events. [2020-10-16 04:51:18,414 INFO L130 PetriNetUnfolder]: For 2971/4531 co-relation queries the response was YES. [2020-10-16 04:51:18,418 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 428 events. 190/428 cut-off events. For 2971/4531 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 2561 event pairs, 0 based on Foata normal form. 189/562 useless extension candidates. Maximal degree in co-relation 2515. Up to 266 conditions per place. [2020-10-16 04:51:18,421 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 2 selfloop transitions, 33 changer transitions 5/70 dead transitions. [2020-10-16 04:51:18,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 70 transitions, 635 flow [2020-10-16 04:51:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:51:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:51:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1911 transitions. [2020-10-16 04:51:18,428 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.847450110864745 [2020-10-16 04:51:18,429 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1911 transitions. [2020-10-16 04:51:18,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1911 transitions. [2020-10-16 04:51:18,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:18,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1911 transitions. [2020-10-16 04:51:18,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:51:18,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:51:18,439 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:51:18,439 INFO L185 Difference]: Start difference. First operand has 76 places, 65 transitions, 501 flow. Second operand 11 states and 1911 transitions. [2020-10-16 04:51:18,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 70 transitions, 635 flow [2020-10-16 04:51:18,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 70 transitions, 520 flow, removed 42 selfloop flow, removed 6 redundant places. [2020-10-16 04:51:18,453 INFO L241 Difference]: Finished difference. Result has 83 places, 65 transitions, 474 flow [2020-10-16 04:51:18,454 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=474, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2020-10-16 04:51:18,454 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2020-10-16 04:51:18,454 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 474 flow [2020-10-16 04:51:18,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:51:18,454 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:18,455 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:18,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:51:18,455 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2112041350, now seen corresponding path program 1 times [2020-10-16 04:51:18,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:18,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010061983] [2020-10-16 04:51:18,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:51:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:51:18,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010061983] [2020-10-16 04:51:18,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:51:18,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 04:51:18,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090934589] [2020-10-16 04:51:18,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 04:51:18,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:51:18,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 04:51:18,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-16 04:51:18,716 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 205 [2020-10-16 04:51:18,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 474 flow. Second operand 12 states. [2020-10-16 04:51:18,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:51:18,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 205 [2020-10-16 04:51:18,718 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:51:19,604 INFO L129 PetriNetUnfolder]: 1170/2458 cut-off events. [2020-10-16 04:51:19,604 INFO L130 PetriNetUnfolder]: For 8816/9848 co-relation queries the response was YES. [2020-10-16 04:51:19,631 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10910 conditions, 2458 events. 1170/2458 cut-off events. For 8816/9848 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 20728 event pairs, 212 based on Foata normal form. 153/2486 useless extension candidates. Maximal degree in co-relation 10884. Up to 1131 conditions per place. [2020-10-16 04:51:19,643 INFO L132 encePairwiseOnDemand]: 195/205 looper letters, 50 selfloop transitions, 53 changer transitions 34/160 dead transitions. [2020-10-16 04:51:19,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 1603 flow [2020-10-16 04:51:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 04:51:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 04:51:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2190 transitions. [2020-10-16 04:51:19,652 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7121951219512195 [2020-10-16 04:51:19,652 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2190 transitions. [2020-10-16 04:51:19,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2190 transitions. [2020-10-16 04:51:19,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:51:19,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2190 transitions. [2020-10-16 04:51:19,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 04:51:19,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 04:51:19,667 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 04:51:19,667 INFO L185 Difference]: Start difference. First operand has 83 places, 65 transitions, 474 flow. Second operand 15 states and 2190 transitions. [2020-10-16 04:51:19,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 1603 flow [2020-10-16 04:51:19,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1242 flow, removed 76 selfloop flow, removed 11 redundant places. [2020-10-16 04:51:19,816 INFO L241 Difference]: Finished difference. Result has 96 places, 107 transitions, 873 flow [2020-10-16 04:51:19,816 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=873, PETRI_PLACES=96, PETRI_TRANSITIONS=107} [2020-10-16 04:51:19,817 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2020-10-16 04:51:19,817 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 107 transitions, 873 flow [2020-10-16 04:51:19,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 04:51:19,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:51:19,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:51:19,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:51:19,818 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:51:19,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:51:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1068153748, now seen corresponding path program 2 times [2020-10-16 04:51:19,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:51:19,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043385402] [2020-10-16 04:51:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:51:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:19,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:51:19,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:51:19,974 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:51:19,975 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:51:19,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:51:19,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:19,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:51:20,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:51:20,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:51:20 BasicIcfg [2020-10-16 04:51:20,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:51:20,092 INFO L168 Benchmark]: Toolchain (without parser) took 14719.08 ms. Allocated memory was 249.0 MB in the beginning and 584.1 MB in the end (delta: 335.0 MB). Free memory was 204.0 MB in the beginning and 517.2 MB in the end (delta: -313.2 MB). Peak memory consumption was 387.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,093 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:51:20,093 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.01 ms. Allocated memory was 249.0 MB in the beginning and 306.7 MB in the end (delta: 57.7 MB). Free memory was 204.0 MB in the beginning and 257.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.71 ms. Allocated memory is still 306.7 MB. Free memory was 257.2 MB in the beginning and 254.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,094 INFO L168 Benchmark]: Boogie Preprocessor took 46.28 ms. Allocated memory is still 306.7 MB. Free memory was 254.6 MB in the beginning and 252.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,097 INFO L168 Benchmark]: RCFGBuilder took 1995.55 ms. Allocated memory was 306.7 MB in the beginning and 355.5 MB in the end (delta: 48.8 MB). Free memory was 252.1 MB in the beginning and 201.0 MB in the end (delta: 51.1 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,098 INFO L168 Benchmark]: TraceAbstraction took 11821.77 ms. Allocated memory was 355.5 MB in the beginning and 584.1 MB in the end (delta: 228.6 MB). Free memory was 201.0 MB in the beginning and 517.2 MB in the end (delta: -316.2 MB). Peak memory consumption was 277.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:51:20,108 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 782.01 ms. Allocated memory was 249.0 MB in the beginning and 306.7 MB in the end (delta: 57.7 MB). Free memory was 204.0 MB in the beginning and 257.2 MB in the end (delta: -53.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.71 ms. Allocated memory is still 306.7 MB. Free memory was 257.2 MB in the beginning and 254.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.28 ms. Allocated memory is still 306.7 MB. Free memory was 254.6 MB in the beginning and 252.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1995.55 ms. Allocated memory was 306.7 MB in the beginning and 355.5 MB in the end (delta: 48.8 MB). Free memory was 252.1 MB in the beginning and 201.0 MB in the end (delta: 51.1 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11821.77 ms. Allocated memory was 355.5 MB in the beginning and 584.1 MB in the end (delta: 228.6 MB). Free memory was 201.0 MB in the beginning and 517.2 MB in the end (delta: -316.2 MB). Peak memory consumption was 277.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1728 VarBasedMoverChecksPositive, 75 VarBasedMoverChecksNegative, 27 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 206 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.6s, 120 PlacesBefore, 42 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 6368 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1149; [L838] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1150; [L840] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1151; [L842] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t1152; [L844] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 4 z$w_buff1 = z$w_buff0 [L794] 4 z$w_buff0 = 2 [L795] 4 z$w_buff1_used = z$w_buff0_used [L796] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L798] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L799] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L800] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L801] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L802] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L803] 4 z$r_buff0_thd4 = (_Bool)1 [L806] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L780] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L781] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L782] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 3 return 0; [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 z$flush_delayed = weak$$choice2 [L860] 0 z$mem_tmp = z [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L862] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L869] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L869] 0 z = z$flush_delayed ? z$mem_tmp : z [L870] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 53 SDtfs, 67 SDslu, 74 SDs, 0 SdLazy, 742 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=873occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 20169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...