/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/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:22:11,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:22:11,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:22:11,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:22:11,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:22:11,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:22:11,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:22:11,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:22:11,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:22:11,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:22:11,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:22:11,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:22:11,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:22:11,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:22:11,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:22:11,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:22:11,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:22:11,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:22:11,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:22:11,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:22:11,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:22:11,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:22:11,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:22:11,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:22:11,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:22:11,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:22:11,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:22:11,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:22:11,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:22:11,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:22:11,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:22:11,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:22:11,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:22:11,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:22:11,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:22:11,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:22:11,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:22:11,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:22:11,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:22:11,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:22:11,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:22:11,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:22:11,321 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:22:11,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:22:11,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:22:11,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:22:11,323 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:22:11,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:22:11,324 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:22:11,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:22:11,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:22:11,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:22:11,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:22:11,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:22:11,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:22:11,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:22:11,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:22:11,327 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:22:11,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:22:11,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:22:11,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:22:11,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:22:11,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:22:11,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:22:11,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:22:11,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:22:11,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:22:11,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:22:11,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:22:11,330 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:22:11,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:22:11,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:22:11,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:22:11,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:22:11,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:22:11,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:22:11,629 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:22:11,629 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2020-10-11 18:22:11,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1cd7b/e56c76b93a0c43d1ae267206832fe414/FLAG6975c498a [2020-10-11 18:22:12,237 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:22:12,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2020-10-11 18:22:12,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1cd7b/e56c76b93a0c43d1ae267206832fe414/FLAG6975c498a [2020-10-11 18:22:12,526 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09cb1cd7b/e56c76b93a0c43d1ae267206832fe414 [2020-10-11 18:22:12,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:22:12,537 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:22:12,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:12,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:22:12,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:22:12,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:12" (1/1) ... [2020-10-11 18:22:12,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3470fc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:12, skipping insertion in model container [2020-10-11 18:22:12,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:12" (1/1) ... [2020-10-11 18:22:12,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:22:12,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:22:13,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:13,065 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:22:13,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:13,241 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:22:13,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13 WrapperNode [2020-10-11 18:22:13,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:13,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:13,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:22:13,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:22:13,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:13,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:22:13,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:22:13,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:22:13,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (1/1) ... [2020-10-11 18:22:13,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:22:13,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:22:13,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:22:13,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:22:13,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (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-11 18:22:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:22:13,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:22:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:22:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:22:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:22:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:22:13,441 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:22:13,441 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:22:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:22:13,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:22:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:22:13,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:22:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:22:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:22:13,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:22:13,445 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:22:15,260 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:22:15,261 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:22:15,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:15 BoogieIcfgContainer [2020-10-11 18:22:15,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:22:15,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:22:15,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:22:15,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:22:15,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:22:12" (1/3) ... [2020-10-11 18:22:15,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10c561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:15, skipping insertion in model container [2020-10-11 18:22:15,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:13" (2/3) ... [2020-10-11 18:22:15,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c10c561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:15, skipping insertion in model container [2020-10-11 18:22:15,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:15" (3/3) ... [2020-10-11 18:22:15,274 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2020-10-11 18:22:15,287 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:22:15,296 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:22:15,297 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:22:15,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,334 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,335 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,338 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,338 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,338 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,353 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,354 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,357 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,358 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,359 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:15,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:22:15,401 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:22:15,402 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:22:15,402 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:22:15,402 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:22:15,402 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:22:15,402 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:22:15,402 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:22:15,402 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:22:15,417 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-11 18:22:15,468 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-11 18:22:15,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:15,473 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-11 18:22:15,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-11 18:22:15,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-11 18:22:15,498 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2020-10-11 18:22:15,499 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:15,499 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:15,500 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, 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-11 18:22:15,501 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-11 18:22:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2067494984, now seen corresponding path program 1 times [2020-10-11 18:22:15,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:15,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805529502] [2020-10-11 18:22:15,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:15,897 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-11 18:22:15,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805529502] [2020-10-11 18:22:15,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:15,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:22:15,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705002351] [2020-10-11 18:22:15,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:22:15,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:22:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:22:16,047 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 112 [2020-10-11 18:22:16,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 228 flow. Second operand 3 states. [2020-10-11 18:22:16,050 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:16,050 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 112 [2020-10-11 18:22:16,052 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:16,087 INFO L129 PetriNetUnfolder]: 0/105 cut-off events. [2020-10-11 18:22:16,087 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:16,087 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 105 events. 0/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 4/107 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:22:16,089 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 0 selfloop transitions, 2 changer transitions 13/105 dead transitions. [2020-10-11 18:22:16,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 105 transitions, 226 flow [2020-10-11 18:22:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:22:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:22:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2020-10-11 18:22:16,106 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9761904761904762 [2020-10-11 18:22:16,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2020-10-11 18:22:16,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2020-10-11 18:22:16,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:16,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2020-10-11 18:22:16,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:22:16,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:22:16,123 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:22:16,125 INFO L185 Difference]: Start difference. First operand has 119 places, 108 transitions, 228 flow. Second operand 3 states and 328 transitions. [2020-10-11 18:22:16,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 105 transitions, 226 flow [2020-10-11 18:22:16,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 105 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:16,136 INFO L241 Difference]: Finished difference. Result has 116 places, 92 transitions, 196 flow [2020-10-11 18:22:16,139 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=116, PETRI_TRANSITIONS=92} [2020-10-11 18:22:16,140 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2020-10-11 18:22:16,141 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 92 transitions, 196 flow [2020-10-11 18:22:16,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:22:16,141 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:16,141 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:16,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:22:16,142 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-11 18:22:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:16,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1349113377, now seen corresponding path program 1 times [2020-10-11 18:22:16,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:16,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272426024] [2020-10-11 18:22:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:16,364 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-11 18:22:16,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272426024] [2020-10-11 18:22:16,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:16,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:16,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295589556] [2020-10-11 18:22:16,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:16,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:16,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:16,553 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 112 [2020-10-11 18:22:16,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 92 transitions, 196 flow. Second operand 6 states. [2020-10-11 18:22:16,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:16,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 112 [2020-10-11 18:22:16,555 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:16,688 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-10-11 18:22:16,688 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:16,689 INFO L80 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 103. Up to 7 conditions per place. [2020-10-11 18:22:16,690 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 6 selfloop transitions, 2 changer transitions 10/102 dead transitions. [2020-10-11 18:22:16,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 252 flow [2020-10-11 18:22:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions. [2020-10-11 18:22:16,697 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9305555555555556 [2020-10-11 18:22:16,697 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions. [2020-10-11 18:22:16,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions. [2020-10-11 18:22:16,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:16,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions. [2020-10-11 18:22:16,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:16,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:16,706 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:16,707 INFO L185 Difference]: Start difference. First operand has 116 places, 92 transitions, 196 flow. Second operand 9 states and 938 transitions. [2020-10-11 18:22:16,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 252 flow [2020-10-11 18:22:16,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:22:16,712 INFO L241 Difference]: Finished difference. Result has 116 places, 92 transitions, 212 flow [2020-10-11 18:22:16,712 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=116, PETRI_TRANSITIONS=92} [2020-10-11 18:22:16,713 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2020-10-11 18:22:16,713 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 92 transitions, 212 flow [2020-10-11 18:22:16,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:16,713 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:16,714 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:16,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:22:16,714 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-11 18:22:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:16,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1419947132, now seen corresponding path program 1 times [2020-10-11 18:22:16,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:16,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824996191] [2020-10-11 18:22:16,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:16,913 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-11 18:22:16,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824996191] [2020-10-11 18:22:16,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:16,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:16,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671943241] [2020-10-11 18:22:16,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:16,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:16,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:17,109 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 112 [2020-10-11 18:22:17,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 92 transitions, 212 flow. Second operand 6 states. [2020-10-11 18:22:17,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:17,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 112 [2020-10-11 18:22:17,111 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:17,316 INFO L129 PetriNetUnfolder]: 24/168 cut-off events. [2020-10-11 18:22:17,316 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2020-10-11 18:22:17,318 INFO L80 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 168 events. 24/168 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 454 event pairs, 5 based on Foata normal form. 4/170 useless extension candidates. Maximal degree in co-relation 258. Up to 31 conditions per place. [2020-10-11 18:22:17,319 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 8 selfloop transitions, 3 changer transitions 19/113 dead transitions. [2020-10-11 18:22:17,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 332 flow [2020-10-11 18:22:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 941 transitions. [2020-10-11 18:22:17,324 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.933531746031746 [2020-10-11 18:22:17,324 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 941 transitions. [2020-10-11 18:22:17,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 941 transitions. [2020-10-11 18:22:17,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:17,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 941 transitions. [2020-10-11 18:22:17,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:17,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:17,329 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:17,330 INFO L185 Difference]: Start difference. First operand has 116 places, 92 transitions, 212 flow. Second operand 9 states and 941 transitions. [2020-10-11 18:22:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 332 flow [2020-10-11 18:22:17,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 113 transitions, 300 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:22:17,335 INFO L241 Difference]: Finished difference. Result has 117 places, 94 transitions, 239 flow [2020-10-11 18:22:17,336 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=117, PETRI_TRANSITIONS=94} [2020-10-11 18:22:17,336 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2020-10-11 18:22:17,336 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 94 transitions, 239 flow [2020-10-11 18:22:17,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:17,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:17,337 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:17,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:22:17,337 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-11 18:22:17,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 37067363, now seen corresponding path program 1 times [2020-10-11 18:22:17,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:17,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639222131] [2020-10-11 18:22:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:17,760 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-11 18:22:17,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639222131] [2020-10-11 18:22:17,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:17,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:17,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462477973] [2020-10-11 18:22:17,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:17,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:17,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:22:18,561 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2020-10-11 18:22:18,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 94 transitions, 239 flow. Second operand 12 states. [2020-10-11 18:22:18,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:18,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2020-10-11 18:22:18,564 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:19,008 INFO L129 PetriNetUnfolder]: 170/504 cut-off events. [2020-10-11 18:22:19,008 INFO L130 PetriNetUnfolder]: For 394/394 co-relation queries the response was YES. [2020-10-11 18:22:19,016 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 504 events. 170/504 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2682 event pairs, 68 based on Foata normal form. 14/499 useless extension candidates. Maximal degree in co-relation 1069. Up to 162 conditions per place. [2020-10-11 18:22:19,020 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 13 selfloop transitions, 9 changer transitions 22/122 dead transitions. [2020-10-11 18:22:19,020 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 403 flow [2020-10-11 18:22:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:22:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:22:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1348 transitions. [2020-10-11 18:22:19,026 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8596938775510204 [2020-10-11 18:22:19,027 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1348 transitions. [2020-10-11 18:22:19,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1348 transitions. [2020-10-11 18:22:19,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:19,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1348 transitions. [2020-10-11 18:22:19,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:22:19,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:22:19,034 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:22:19,035 INFO L185 Difference]: Start difference. First operand has 117 places, 94 transitions, 239 flow. Second operand 14 states and 1348 transitions. [2020-10-11 18:22:19,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 403 flow [2020-10-11 18:22:19,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 122 transitions, 386 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:19,043 INFO L241 Difference]: Finished difference. Result has 128 places, 98 transitions, 288 flow [2020-10-11 18:22:19,044 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=288, PETRI_PLACES=128, PETRI_TRANSITIONS=98} [2020-10-11 18:22:19,044 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 9 predicate places. [2020-10-11 18:22:19,044 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 98 transitions, 288 flow [2020-10-11 18:22:19,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:22:19,044 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:19,045 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:19,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:22:19,045 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-11 18:22:19,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash 283140971, now seen corresponding path program 1 times [2020-10-11 18:22:19,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:19,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955603145] [2020-10-11 18:22:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:19,429 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-11 18:22:19,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955603145] [2020-10-11 18:22:19,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:19,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:19,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955689717] [2020-10-11 18:22:19,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:19,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:19,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:22:20,883 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2020-10-11 18:22:20,883 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 98 transitions, 288 flow. Second operand 12 states. [2020-10-11 18:22:20,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:20,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2020-10-11 18:22:20,884 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:21,282 INFO L129 PetriNetUnfolder]: 146/425 cut-off events. [2020-10-11 18:22:21,283 INFO L130 PetriNetUnfolder]: For 832/837 co-relation queries the response was YES. [2020-10-11 18:22:21,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 425 events. 146/425 cut-off events. For 832/837 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2025 event pairs, 21 based on Foata normal form. 9/421 useless extension candidates. Maximal degree in co-relation 1197. Up to 156 conditions per place. [2020-10-11 18:22:21,294 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 17 selfloop transitions, 11 changer transitions 19/124 dead transitions. [2020-10-11 18:22:21,295 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 124 transitions, 522 flow [2020-10-11 18:22:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:22:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:22:21,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1334 transitions. [2020-10-11 18:22:21,300 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8507653061224489 [2020-10-11 18:22:21,300 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1334 transitions. [2020-10-11 18:22:21,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1334 transitions. [2020-10-11 18:22:21,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:21,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1334 transitions. [2020-10-11 18:22:21,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:22:21,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:22:21,307 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:22:21,307 INFO L185 Difference]: Start difference. First operand has 128 places, 98 transitions, 288 flow. Second operand 14 states and 1334 transitions. [2020-10-11 18:22:21,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 124 transitions, 522 flow [2020-10-11 18:22:21,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 124 transitions, 500 flow, removed 7 selfloop flow, removed 7 redundant places. [2020-10-11 18:22:21,321 INFO L241 Difference]: Finished difference. Result has 135 places, 102 transitions, 341 flow [2020-10-11 18:22:21,321 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=341, PETRI_PLACES=135, PETRI_TRANSITIONS=102} [2020-10-11 18:22:21,321 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2020-10-11 18:22:21,322 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 341 flow [2020-10-11 18:22:21,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:22:21,322 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:21,322 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:21,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:22:21,323 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-11 18:22:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1371605395, now seen corresponding path program 2 times [2020-10-11 18:22:21,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573320095] [2020-10-11 18:22:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:21,551 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-11 18:22:21,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573320095] [2020-10-11 18:22:21,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:21,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:22:21,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721419631] [2020-10-11 18:22:21,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:22:21,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:22:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:22:22,415 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 112 [2020-10-11 18:22:22,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 341 flow. Second operand 9 states. [2020-10-11 18:22:22,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:22,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 112 [2020-10-11 18:22:22,417 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:22,705 INFO L129 PetriNetUnfolder]: 160/470 cut-off events. [2020-10-11 18:22:22,705 INFO L130 PetriNetUnfolder]: For 2122/2135 co-relation queries the response was YES. [2020-10-11 18:22:22,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 470 events. 160/470 cut-off events. For 2122/2135 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2369 event pairs, 20 based on Foata normal form. 12/468 useless extension candidates. Maximal degree in co-relation 1655. Up to 163 conditions per place. [2020-10-11 18:22:22,717 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 20 selfloop transitions, 10 changer transitions 10/120 dead transitions. [2020-10-11 18:22:22,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 120 transitions, 577 flow [2020-10-11 18:22:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:22:22,727 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8829365079365079 [2020-10-11 18:22:22,735 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:22:22,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:22:22,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:22,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:22:22,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:22,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:22,745 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:22,745 INFO L185 Difference]: Start difference. First operand has 135 places, 102 transitions, 341 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:22:22,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 120 transitions, 577 flow [2020-10-11 18:22:22,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 120 transitions, 500 flow, removed 36 selfloop flow, removed 9 redundant places. [2020-10-11 18:22:22,753 INFO L241 Difference]: Finished difference. Result has 132 places, 105 transitions, 365 flow [2020-10-11 18:22:22,754 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=132, PETRI_TRANSITIONS=105} [2020-10-11 18:22:22,754 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2020-10-11 18:22:22,754 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 105 transitions, 365 flow [2020-10-11 18:22:22,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:22:22,754 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:22,754 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:22,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:22:22,755 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-11 18:22:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1756983229, now seen corresponding path program 3 times [2020-10-11 18:22:22,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:22,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097272779] [2020-10-11 18:22:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:22,984 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-11 18:22:22,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097272779] [2020-10-11 18:22:22,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:22,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:22,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167693554] [2020-10-11 18:22:22,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:22,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:22:23,979 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 112 [2020-10-11 18:22:23,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 105 transitions, 365 flow. Second operand 10 states. [2020-10-11 18:22:23,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:23,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 112 [2020-10-11 18:22:23,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:24,397 INFO L129 PetriNetUnfolder]: 131/455 cut-off events. [2020-10-11 18:22:24,397 INFO L130 PetriNetUnfolder]: For 1427/1564 co-relation queries the response was YES. [2020-10-11 18:22:24,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 455 events. 131/455 cut-off events. For 1427/1564 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2427 event pairs, 16 based on Foata normal form. 21/466 useless extension candidates. Maximal degree in co-relation 1473. Up to 125 conditions per place. [2020-10-11 18:22:24,405 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 18 selfloop transitions, 11 changer transitions 19/130 dead transitions. [2020-10-11 18:22:24,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 130 transitions, 675 flow [2020-10-11 18:22:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1194 transitions. [2020-10-11 18:22:24,410 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8883928571428571 [2020-10-11 18:22:24,410 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1194 transitions. [2020-10-11 18:22:24,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1194 transitions. [2020-10-11 18:22:24,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:24,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1194 transitions. [2020-10-11 18:22:24,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:24,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:24,417 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:24,417 INFO L185 Difference]: Start difference. First operand has 132 places, 105 transitions, 365 flow. Second operand 12 states and 1194 transitions. [2020-10-11 18:22:24,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 130 transitions, 675 flow [2020-10-11 18:22:24,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 130 transitions, 642 flow, removed 13 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:24,425 INFO L241 Difference]: Finished difference. Result has 141 places, 107 transitions, 424 flow [2020-10-11 18:22:24,425 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=424, PETRI_PLACES=141, PETRI_TRANSITIONS=107} [2020-10-11 18:22:24,425 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places. [2020-10-11 18:22:24,426 INFO L481 AbstractCegarLoop]: Abstraction has has 141 places, 107 transitions, 424 flow [2020-10-11 18:22:24,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:22:24,426 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:24,426 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:24,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:22:24,426 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-11 18:22:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1015579710, now seen corresponding path program 1 times [2020-10-11 18:22:24,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:24,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912836837] [2020-10-11 18:22:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:24,723 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-11 18:22:24,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912836837] [2020-10-11 18:22:24,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:24,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:22:24,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673313681] [2020-10-11 18:22:24,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:22:24,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:22:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:22:26,257 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2020-10-11 18:22:26,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 107 transitions, 424 flow. Second operand 13 states. [2020-10-11 18:22:26,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:26,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2020-10-11 18:22:26,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:26,775 INFO L129 PetriNetUnfolder]: 123/426 cut-off events. [2020-10-11 18:22:26,775 INFO L130 PetriNetUnfolder]: For 2464/2501 co-relation queries the response was YES. [2020-10-11 18:22:26,783 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1752 conditions, 426 events. 123/426 cut-off events. For 2464/2501 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2111 event pairs, 13 based on Foata normal form. 12/425 useless extension candidates. Maximal degree in co-relation 1675. Up to 164 conditions per place. [2020-10-11 18:22:26,791 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 26 selfloop transitions, 16 changer transitions 11/130 dead transitions. [2020-10-11 18:22:26,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 130 transitions, 765 flow [2020-10-11 18:22:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1421 transitions. [2020-10-11 18:22:26,798 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8458333333333333 [2020-10-11 18:22:26,799 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1421 transitions. [2020-10-11 18:22:26,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1421 transitions. [2020-10-11 18:22:26,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:26,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1421 transitions. [2020-10-11 18:22:26,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:26,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:26,811 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:26,811 INFO L185 Difference]: Start difference. First operand has 141 places, 107 transitions, 424 flow. Second operand 15 states and 1421 transitions. [2020-10-11 18:22:26,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 130 transitions, 765 flow [2020-10-11 18:22:26,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 726 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-11 18:22:26,829 INFO L241 Difference]: Finished difference. Result has 151 places, 115 transitions, 540 flow [2020-10-11 18:22:26,829 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=540, PETRI_PLACES=151, PETRI_TRANSITIONS=115} [2020-10-11 18:22:26,830 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 32 predicate places. [2020-10-11 18:22:26,830 INFO L481 AbstractCegarLoop]: Abstraction has has 151 places, 115 transitions, 540 flow [2020-10-11 18:22:26,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:22:26,830 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:26,830 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:26,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:22:26,831 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-11 18:22:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 514966594, now seen corresponding path program 2 times [2020-10-11 18:22:26,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:26,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363856533] [2020-10-11 18:22:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:27,232 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-11 18:22:27,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363856533] [2020-10-11 18:22:27,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:27,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:22:27,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038036738] [2020-10-11 18:22:27,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:22:27,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:27,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:22:27,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:22:28,839 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2020-10-11 18:22:28,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 115 transitions, 540 flow. Second operand 13 states. [2020-10-11 18:22:28,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:28,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2020-10-11 18:22:28,841 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:29,217 INFO L129 PetriNetUnfolder]: 123/467 cut-off events. [2020-10-11 18:22:29,217 INFO L130 PetriNetUnfolder]: For 3793/3938 co-relation queries the response was YES. [2020-10-11 18:22:29,225 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 467 events. 123/467 cut-off events. For 3793/3938 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2571 event pairs, 14 based on Foata normal form. 39/493 useless extension candidates. Maximal degree in co-relation 1936. Up to 176 conditions per place. [2020-10-11 18:22:29,229 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 25 selfloop transitions, 17 changer transitions 10/130 dead transitions. [2020-10-11 18:22:29,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 130 transitions, 876 flow [2020-10-11 18:22:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:22:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:22:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1338 transitions. [2020-10-11 18:22:29,234 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8533163265306123 [2020-10-11 18:22:29,234 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1338 transitions. [2020-10-11 18:22:29,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1338 transitions. [2020-10-11 18:22:29,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:29,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1338 transitions. [2020-10-11 18:22:29,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:22:29,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:22:29,242 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:22:29,242 INFO L185 Difference]: Start difference. First operand has 151 places, 115 transitions, 540 flow. Second operand 14 states and 1338 transitions. [2020-10-11 18:22:29,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 130 transitions, 876 flow [2020-10-11 18:22:29,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 130 transitions, 763 flow, removed 54 selfloop flow, removed 9 redundant places. [2020-10-11 18:22:29,254 INFO L241 Difference]: Finished difference. Result has 156 places, 118 transitions, 590 flow [2020-10-11 18:22:29,255 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=590, PETRI_PLACES=156, PETRI_TRANSITIONS=118} [2020-10-11 18:22:29,255 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 37 predicate places. [2020-10-11 18:22:29,255 INFO L481 AbstractCegarLoop]: Abstraction has has 156 places, 118 transitions, 590 flow [2020-10-11 18:22:29,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:22:29,255 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:29,256 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:29,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:22:29,256 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-11 18:22:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:29,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1204517416, now seen corresponding path program 3 times [2020-10-11 18:22:29,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:29,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801403870] [2020-10-11 18:22:29,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:29,617 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-11 18:22:29,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801403870] [2020-10-11 18:22:29,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:29,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:22:29,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672438592] [2020-10-11 18:22:29,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:22:29,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:22:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:22:31,591 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 112 [2020-10-11 18:22:31,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 118 transitions, 590 flow. Second operand 14 states. [2020-10-11 18:22:31,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:31,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 112 [2020-10-11 18:22:31,592 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:32,022 INFO L129 PetriNetUnfolder]: 122/465 cut-off events. [2020-10-11 18:22:32,022 INFO L130 PetriNetUnfolder]: For 4105/4241 co-relation queries the response was YES. [2020-10-11 18:22:32,027 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2098 conditions, 465 events. 122/465 cut-off events. For 4105/4241 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2483 event pairs, 17 based on Foata normal form. 38/490 useless extension candidates. Maximal degree in co-relation 2010. Up to 168 conditions per place. [2020-10-11 18:22:32,033 INFO L132 encePairwiseOnDemand]: 98/112 looper letters, 23 selfloop transitions, 22 changer transitions 10/132 dead transitions. [2020-10-11 18:22:32,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 132 transitions, 917 flow [2020-10-11 18:22:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:22:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:22:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1512 transitions. [2020-10-11 18:22:32,041 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.84375 [2020-10-11 18:22:32,041 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1512 transitions. [2020-10-11 18:22:32,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1512 transitions. [2020-10-11 18:22:32,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:32,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1512 transitions. [2020-10-11 18:22:32,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:22:32,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:22:32,049 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:22:32,049 INFO L185 Difference]: Start difference. First operand has 156 places, 118 transitions, 590 flow. Second operand 16 states and 1512 transitions. [2020-10-11 18:22:32,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 132 transitions, 917 flow [2020-10-11 18:22:32,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 132 transitions, 800 flow, removed 48 selfloop flow, removed 12 redundant places. [2020-10-11 18:22:32,063 INFO L241 Difference]: Finished difference. Result has 161 places, 121 transitions, 643 flow [2020-10-11 18:22:32,063 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=643, PETRI_PLACES=161, PETRI_TRANSITIONS=121} [2020-10-11 18:22:32,063 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2020-10-11 18:22:32,063 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 121 transitions, 643 flow [2020-10-11 18:22:32,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:22:32,064 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:32,064 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:32,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:22:32,064 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-11 18:22:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2000965314, now seen corresponding path program 4 times [2020-10-11 18:22:32,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:32,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219672136] [2020-10-11 18:22:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:32,360 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-11 18:22:32,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219672136] [2020-10-11 18:22:32,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:32,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:32,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386767733] [2020-10-11 18:22:32,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:32,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:32,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:22:34,119 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 112 [2020-10-11 18:22:34,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 121 transitions, 643 flow. Second operand 12 states. [2020-10-11 18:22:34,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:34,121 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 112 [2020-10-11 18:22:34,121 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:34,433 INFO L129 PetriNetUnfolder]: 104/512 cut-off events. [2020-10-11 18:22:34,433 INFO L130 PetriNetUnfolder]: For 3401/3602 co-relation queries the response was YES. [2020-10-11 18:22:34,438 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 512 events. 104/512 cut-off events. For 3401/3602 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3093 event pairs, 6 based on Foata normal form. 34/534 useless extension candidates. Maximal degree in co-relation 1936. Up to 119 conditions per place. [2020-10-11 18:22:34,443 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 35 selfloop transitions, 14 changer transitions 10/137 dead transitions. [2020-10-11 18:22:34,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 137 transitions, 983 flow [2020-10-11 18:22:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:22:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:22:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1340 transitions. [2020-10-11 18:22:34,448 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8545918367346939 [2020-10-11 18:22:34,448 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1340 transitions. [2020-10-11 18:22:34,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1340 transitions. [2020-10-11 18:22:34,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:34,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1340 transitions. [2020-10-11 18:22:34,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:22:34,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:22:34,453 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:22:34,453 INFO L185 Difference]: Start difference. First operand has 161 places, 121 transitions, 643 flow. Second operand 14 states and 1340 transitions. [2020-10-11 18:22:34,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 137 transitions, 983 flow [2020-10-11 18:22:34,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 137 transitions, 834 flow, removed 59 selfloop flow, removed 14 redundant places. [2020-10-11 18:22:34,468 INFO L241 Difference]: Finished difference. Result has 161 places, 121 transitions, 609 flow [2020-10-11 18:22:34,468 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=609, PETRI_PLACES=161, PETRI_TRANSITIONS=121} [2020-10-11 18:22:34,469 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places. [2020-10-11 18:22:34,469 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 121 transitions, 609 flow [2020-10-11 18:22:34,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:22:34,469 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:34,469 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:34,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:22:34,470 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-11 18:22:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1022008124, now seen corresponding path program 1 times [2020-10-11 18:22:34,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:34,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199829035] [2020-10-11 18:22:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:34,588 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-11 18:22:34,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199829035] [2020-10-11 18:22:34,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:34,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:34,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366099345] [2020-10-11 18:22:34,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:34,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:34,728 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2020-10-11 18:22:34,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 121 transitions, 609 flow. Second operand 6 states. [2020-10-11 18:22:34,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:34,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2020-10-11 18:22:34,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:35,302 INFO L129 PetriNetUnfolder]: 1199/2731 cut-off events. [2020-10-11 18:22:35,302 INFO L130 PetriNetUnfolder]: For 5471/5626 co-relation queries the response was YES. [2020-10-11 18:22:35,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7145 conditions, 2731 events. 1199/2731 cut-off events. For 5471/5626 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 23381 event pairs, 149 based on Foata normal form. 104/2521 useless extension candidates. Maximal degree in co-relation 7061. Up to 827 conditions per place. [2020-10-11 18:22:35,354 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 23 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2020-10-11 18:22:35,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 152 transitions, 755 flow [2020-10-11 18:22:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2020-10-11 18:22:35,359 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9186507936507936 [2020-10-11 18:22:35,359 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2020-10-11 18:22:35,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2020-10-11 18:22:35,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:35,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2020-10-11 18:22:35,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:35,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:35,365 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:35,365 INFO L185 Difference]: Start difference. First operand has 161 places, 121 transitions, 609 flow. Second operand 9 states and 926 transitions. [2020-10-11 18:22:35,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 152 transitions, 755 flow [2020-10-11 18:22:35,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 152 transitions, 691 flow, removed 20 selfloop flow, removed 15 redundant places. [2020-10-11 18:22:35,393 INFO L241 Difference]: Finished difference. Result has 153 places, 138 transitions, 679 flow [2020-10-11 18:22:35,394 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=679, PETRI_PLACES=153, PETRI_TRANSITIONS=138} [2020-10-11 18:22:35,394 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 34 predicate places. [2020-10-11 18:22:35,394 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 138 transitions, 679 flow [2020-10-11 18:22:35,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:35,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:35,395 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:35,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:22:35,395 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -877192840, now seen corresponding path program 1 times [2020-10-11 18:22:35,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:35,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798102719] [2020-10-11 18:22:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:35,547 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-11 18:22:35,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798102719] [2020-10-11 18:22:35,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:35,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:35,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994636061] [2020-10-11 18:22:35,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:35,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:35,677 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2020-10-11 18:22:35,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 138 transitions, 679 flow. Second operand 7 states. [2020-10-11 18:22:35,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:35,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2020-10-11 18:22:35,678 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:36,190 INFO L129 PetriNetUnfolder]: 1159/2677 cut-off events. [2020-10-11 18:22:36,190 INFO L130 PetriNetUnfolder]: For 7992/13856 co-relation queries the response was YES. [2020-10-11 18:22:36,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9854 conditions, 2677 events. 1159/2677 cut-off events. For 7992/13856 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 22664 event pairs, 30 based on Foata normal form. 314/2703 useless extension candidates. Maximal degree in co-relation 9776. Up to 1183 conditions per place. [2020-10-11 18:22:36,230 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 25 selfloop transitions, 37 changer transitions 0/172 dead transitions. [2020-10-11 18:22:36,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 172 transitions, 1032 flow [2020-10-11 18:22:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1236 transitions. [2020-10-11 18:22:36,233 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2020-10-11 18:22:36,233 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1236 transitions. [2020-10-11 18:22:36,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1236 transitions. [2020-10-11 18:22:36,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:36,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1236 transitions. [2020-10-11 18:22:36,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:36,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:36,238 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:36,238 INFO L185 Difference]: Start difference. First operand has 153 places, 138 transitions, 679 flow. Second operand 12 states and 1236 transitions. [2020-10-11 18:22:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 172 transitions, 1032 flow [2020-10-11 18:22:36,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 172 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:22:36,257 INFO L241 Difference]: Finished difference. Result has 168 places, 157 transitions, 957 flow [2020-10-11 18:22:36,258 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=957, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2020-10-11 18:22:36,258 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 49 predicate places. [2020-10-11 18:22:36,258 INFO L481 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 957 flow [2020-10-11 18:22:36,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:36,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:36,258 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:36,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:22:36,259 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:36,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash 683081781, now seen corresponding path program 1 times [2020-10-11 18:22:36,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:36,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673851536] [2020-10-11 18:22:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:36,371 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-11 18:22:36,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673851536] [2020-10-11 18:22:36,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:36,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:36,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546973076] [2020-10-11 18:22:36,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:36,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:36,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:36,551 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 112 [2020-10-11 18:22:36,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 957 flow. Second operand 6 states. [2020-10-11 18:22:36,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:36,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 112 [2020-10-11 18:22:36,552 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:37,058 INFO L129 PetriNetUnfolder]: 853/2873 cut-off events. [2020-10-11 18:22:37,058 INFO L130 PetriNetUnfolder]: For 12938/18838 co-relation queries the response was YES. [2020-10-11 18:22:37,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11552 conditions, 2873 events. 853/2873 cut-off events. For 12938/18838 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 28522 event pairs, 87 based on Foata normal form. 135/2733 useless extension candidates. Maximal degree in co-relation 11467. Up to 1033 conditions per place. [2020-10-11 18:22:37,091 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 14 selfloop transitions, 11 changer transitions 0/171 dead transitions. [2020-10-11 18:22:37,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 171 transitions, 1103 flow [2020-10-11 18:22:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 935 transitions. [2020-10-11 18:22:37,093 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9275793650793651 [2020-10-11 18:22:37,094 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 935 transitions. [2020-10-11 18:22:37,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 935 transitions. [2020-10-11 18:22:37,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:37,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 935 transitions. [2020-10-11 18:22:37,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:37,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:37,097 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:37,097 INFO L185 Difference]: Start difference. First operand has 168 places, 157 transitions, 957 flow. Second operand 9 states and 935 transitions. [2020-10-11 18:22:37,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 171 transitions, 1103 flow [2020-10-11 18:22:37,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 171 transitions, 1000 flow, removed 42 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:37,160 INFO L241 Difference]: Finished difference. Result has 179 places, 165 transitions, 981 flow [2020-10-11 18:22:37,161 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=981, PETRI_PLACES=179, PETRI_TRANSITIONS=165} [2020-10-11 18:22:37,161 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 60 predicate places. [2020-10-11 18:22:37,161 INFO L481 AbstractCegarLoop]: Abstraction has has 179 places, 165 transitions, 981 flow [2020-10-11 18:22:37,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:37,161 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:37,161 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:22:37,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:22:37,162 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2018798597, now seen corresponding path program 1 times [2020-10-11 18:22:37,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:37,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304436251] [2020-10-11 18:22:37,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:37,291 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-11 18:22:37,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304436251] [2020-10-11 18:22:37,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:37,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:22:37,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898467930] [2020-10-11 18:22:37,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:22:37,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:37,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:22:37,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:22:37,481 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2020-10-11 18:22:37,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 165 transitions, 981 flow. Second operand 8 states. [2020-10-11 18:22:37,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:37,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2020-10-11 18:22:37,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:38,389 INFO L129 PetriNetUnfolder]: 1621/3544 cut-off events. [2020-10-11 18:22:38,389 INFO L130 PetriNetUnfolder]: For 26819/38146 co-relation queries the response was YES. [2020-10-11 18:22:38,409 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16756 conditions, 3544 events. 1621/3544 cut-off events. For 26819/38146 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 31065 event pairs, 5 based on Foata normal form. 533/3666 useless extension candidates. Maximal degree in co-relation 16665. Up to 1450 conditions per place. [2020-10-11 18:22:38,423 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 19 selfloop transitions, 57 changer transitions 18/195 dead transitions. [2020-10-11 18:22:38,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 195 transitions, 1481 flow [2020-10-11 18:22:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:22:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:22:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1546 transitions. [2020-10-11 18:22:38,431 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9202380952380952 [2020-10-11 18:22:38,431 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1546 transitions. [2020-10-11 18:22:38,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1546 transitions. [2020-10-11 18:22:38,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:38,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1546 transitions. [2020-10-11 18:22:38,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:22:38,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:22:38,439 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:22:38,439 INFO L185 Difference]: Start difference. First operand has 179 places, 165 transitions, 981 flow. Second operand 15 states and 1546 transitions. [2020-10-11 18:22:38,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 195 transitions, 1481 flow [2020-10-11 18:22:38,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 1406 flow, removed 24 selfloop flow, removed 6 redundant places. [2020-10-11 18:22:38,502 INFO L241 Difference]: Finished difference. Result has 190 places, 173 transitions, 1212 flow [2020-10-11 18:22:38,503 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1212, PETRI_PLACES=190, PETRI_TRANSITIONS=173} [2020-10-11 18:22:38,504 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 71 predicate places. [2020-10-11 18:22:38,504 INFO L481 AbstractCegarLoop]: Abstraction has has 190 places, 173 transitions, 1212 flow [2020-10-11 18:22:38,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:22:38,504 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:38,504 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, 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, 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-11 18:22:38,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:22:38,505 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash -717018091, now seen corresponding path program 1 times [2020-10-11 18:22:38,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:38,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827077995] [2020-10-11 18:22:38,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:38,640 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-11 18:22:38,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827077995] [2020-10-11 18:22:38,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:38,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:38,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855469996] [2020-10-11 18:22:38,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:38,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:38,914 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2020-10-11 18:22:38,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 173 transitions, 1212 flow. Second operand 7 states. [2020-10-11 18:22:38,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:38,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2020-10-11 18:22:38,915 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:39,586 INFO L129 PetriNetUnfolder]: 2187/5501 cut-off events. [2020-10-11 18:22:39,586 INFO L130 PetriNetUnfolder]: For 45755/52127 co-relation queries the response was YES. [2020-10-11 18:22:39,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 25256 conditions, 5501 events. 2187/5501 cut-off events. For 45755/52127 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 58644 event pairs, 9 based on Foata normal form. 20/4893 useless extension candidates. Maximal degree in co-relation 25162. Up to 2025 conditions per place. [2020-10-11 18:22:40,360 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 14 selfloop transitions, 2 changer transitions 7/183 dead transitions. [2020-10-11 18:22:40,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 183 transitions, 1340 flow [2020-10-11 18:22:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:22:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:22:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2020-10-11 18:22:40,362 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9196428571428571 [2020-10-11 18:22:40,362 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2020-10-11 18:22:40,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2020-10-11 18:22:40,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:40,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2020-10-11 18:22:40,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:22:40,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:22:40,365 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:22:40,366 INFO L185 Difference]: Start difference. First operand has 190 places, 173 transitions, 1212 flow. Second operand 7 states and 721 transitions. [2020-10-11 18:22:40,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 183 transitions, 1340 flow [2020-10-11 18:22:41,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 183 transitions, 973 flow, removed 137 selfloop flow, removed 19 redundant places. [2020-10-11 18:22:41,139 INFO L241 Difference]: Finished difference. Result has 176 places, 171 transitions, 866 flow [2020-10-11 18:22:41,139 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=866, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2020-10-11 18:22:41,139 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 57 predicate places. [2020-10-11 18:22:41,139 INFO L481 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 866 flow [2020-10-11 18:22:41,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:41,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:41,139 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, 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, 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-11 18:22:41,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:22:41,140 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -453587323, now seen corresponding path program 2 times [2020-10-11 18:22:41,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:41,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681977579] [2020-10-11 18:22:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:41,299 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-11 18:22:41,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681977579] [2020-10-11 18:22:41,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:41,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:22:41,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865264384] [2020-10-11 18:22:41,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:22:41,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:22:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:22:41,567 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2020-10-11 18:22:41,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 866 flow. Second operand 9 states. [2020-10-11 18:22:41,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:41,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2020-10-11 18:22:41,568 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:42,704 INFO L129 PetriNetUnfolder]: 2816/6068 cut-off events. [2020-10-11 18:22:42,704 INFO L130 PetriNetUnfolder]: For 10590/27080 co-relation queries the response was YES. [2020-10-11 18:22:42,739 INFO L80 FinitePrefix]: Finished finitePrefix Result has 20167 conditions, 6068 events. 2816/6068 cut-off events. For 10590/27080 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 61406 event pairs, 0 based on Foata normal form. 1064/6298 useless extension candidates. Maximal degree in co-relation 20125. Up to 1144 conditions per place. [2020-10-11 18:22:42,757 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 12 selfloop transitions, 63 changer transitions 21/192 dead transitions. [2020-10-11 18:22:42,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 192 transitions, 1196 flow [2020-10-11 18:22:42,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:22:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:22:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1840 transitions. [2020-10-11 18:22:42,761 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9126984126984127 [2020-10-11 18:22:42,761 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1840 transitions. [2020-10-11 18:22:42,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1840 transitions. [2020-10-11 18:22:42,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:42,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1840 transitions. [2020-10-11 18:22:42,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:22:42,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:22:42,767 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:22:42,767 INFO L185 Difference]: Start difference. First operand has 176 places, 171 transitions, 866 flow. Second operand 18 states and 1840 transitions. [2020-10-11 18:22:42,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 192 transitions, 1196 flow [2020-10-11 18:22:42,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 192 transitions, 1124 flow, removed 22 selfloop flow, removed 17 redundant places. [2020-10-11 18:22:42,967 INFO L241 Difference]: Finished difference. Result has 178 places, 167 transitions, 939 flow [2020-10-11 18:22:42,967 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=939, PETRI_PLACES=178, PETRI_TRANSITIONS=167} [2020-10-11 18:22:42,967 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 59 predicate places. [2020-10-11 18:22:42,967 INFO L481 AbstractCegarLoop]: Abstraction has has 178 places, 167 transitions, 939 flow [2020-10-11 18:22:42,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:22:42,968 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:42,968 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, 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, 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, 1, 1, 1] [2020-10-11 18:22:42,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:22:42,968 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash 274323671, now seen corresponding path program 1 times [2020-10-11 18:22:42,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:42,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966229710] [2020-10-11 18:22:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:43,109 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-11 18:22:43,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966229710] [2020-10-11 18:22:43,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:43,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:22:43,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115643325] [2020-10-11 18:22:43,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:22:43,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:22:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:22:43,401 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 112 [2020-10-11 18:22:43,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 167 transitions, 939 flow. Second operand 7 states. [2020-10-11 18:22:43,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:43,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 112 [2020-10-11 18:22:43,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:44,467 INFO L129 PetriNetUnfolder]: 3909/9636 cut-off events. [2020-10-11 18:22:44,467 INFO L130 PetriNetUnfolder]: For 28308/33492 co-relation queries the response was YES. [2020-10-11 18:22:44,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31840 conditions, 9636 events. 3909/9636 cut-off events. For 28308/33492 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 114092 event pairs, 0 based on Foata normal form. 7/8286 useless extension candidates. Maximal degree in co-relation 31760. Up to 1288 conditions per place. [2020-10-11 18:22:44,561 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 9 selfloop transitions, 1 changer transitions 20/172 dead transitions. [2020-10-11 18:22:44,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 172 transitions, 985 flow [2020-10-11 18:22:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:22:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:22:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 716 transitions. [2020-10-11 18:22:44,563 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9132653061224489 [2020-10-11 18:22:44,563 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 716 transitions. [2020-10-11 18:22:44,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 716 transitions. [2020-10-11 18:22:44,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:44,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 716 transitions. [2020-10-11 18:22:44,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:22:44,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:22:44,566 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:22:44,566 INFO L185 Difference]: Start difference. First operand has 178 places, 167 transitions, 939 flow. Second operand 7 states and 716 transitions. [2020-10-11 18:22:44,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 172 transitions, 985 flow [2020-10-11 18:22:45,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 172 transitions, 881 flow, removed 4 selfloop flow, removed 14 redundant places. [2020-10-11 18:22:45,675 INFO L241 Difference]: Finished difference. Result has 173 places, 152 transitions, 750 flow [2020-10-11 18:22:45,676 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=750, PETRI_PLACES=173, PETRI_TRANSITIONS=152} [2020-10-11 18:22:45,676 INFO L341 CegarLoopForPetriNet]: 119 programPoint places, 54 predicate places. [2020-10-11 18:22:45,676 INFO L481 AbstractCegarLoop]: Abstraction has has 173 places, 152 transitions, 750 flow [2020-10-11 18:22:45,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:22:45,676 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:45,676 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, 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, 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, 1, 1, 1] [2020-10-11 18:22:45,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:22:45,676 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash 103078977, now seen corresponding path program 2 times [2020-10-11 18:22:45,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:45,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991686195] [2020-10-11 18:22:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:45,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:22:45,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:22:45,806 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:22:45,806 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:22:45,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:22:45,858 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-11 18:22:45,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,859 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-11 18:22:45,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,860 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-11 18:22:45,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,860 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-11 18:22:45,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,860 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-11 18:22:45,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,861 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-11 18:22:45,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,861 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-11 18:22:45,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,862 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-11 18:22:45,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,862 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-11 18:22:45,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,862 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-11 18:22:45,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,862 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-11 18:22:45,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,863 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-11 18:22:45,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,863 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-11 18:22:45,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,865 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-11 18:22:45,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,865 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-11 18:22:45,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,865 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-11 18:22:45,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,866 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-11 18:22:45,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,866 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-11 18:22:45,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,866 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-11 18:22:45,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,867 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-11 18:22:45,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,867 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-11 18:22:45,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,867 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-11 18:22:45,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,868 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-11 18:22:45,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,868 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-11 18:22:45,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,868 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-11 18:22:45,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,869 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-11 18:22:45,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,869 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-11 18:22:45,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,869 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-11 18:22:45,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:45,869 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-11 18:22:45,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:22:46,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:22:45 BasicIcfg [2020-10-11 18:22:46,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:22:46,007 INFO L168 Benchmark]: Toolchain (without parser) took 33469.64 ms. Allocated memory was 253.8 MB in the beginning and 1.1 GB in the end (delta: 872.4 MB). Free memory was 208.9 MB in the beginning and 504.3 MB in the end (delta: -295.4 MB). Peak memory consumption was 577.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,008 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:22:46,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.02 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 208.9 MB in the beginning and 270.1 MB in the end (delta: -61.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 321.9 MB. Free memory was 270.1 MB in the beginning and 267.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,010 INFO L168 Benchmark]: Boogie Preprocessor took 55.39 ms. Allocated memory is still 321.9 MB. Free memory was 267.6 MB in the beginning and 265.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,011 INFO L168 Benchmark]: RCFGBuilder took 1895.08 ms. Allocated memory was 321.9 MB in the beginning and 362.3 MB in the end (delta: 40.4 MB). Free memory was 265.1 MB in the beginning and 210.6 MB in the end (delta: 54.5 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,011 INFO L168 Benchmark]: TraceAbstraction took 30738.61 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 763.9 MB). Free memory was 210.6 MB in the beginning and 504.3 MB in the end (delta: -293.7 MB). Peak memory consumption was 470.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:22:46,022 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.20 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 704.02 ms. Allocated memory was 253.8 MB in the beginning and 321.9 MB in the end (delta: 68.2 MB). Free memory was 208.9 MB in the beginning and 270.1 MB in the end (delta: -61.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.07 ms. Allocated memory is still 321.9 MB. Free memory was 270.1 MB in the beginning and 267.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 55.39 ms. Allocated memory is still 321.9 MB. Free memory was 267.6 MB in the beginning and 265.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1895.08 ms. Allocated memory was 321.9 MB in the beginning and 362.3 MB in the end (delta: 40.4 MB). Free memory was 265.1 MB in the beginning and 210.6 MB in the end (delta: 54.5 MB). Peak memory consumption was 97.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 30738.61 ms. Allocated memory was 362.3 MB in the beginning and 1.1 GB in the end (delta: 763.9 MB). Free memory was 210.6 MB in the beginning and 504.3 MB in the end (delta: -293.7 MB). Peak memory consumption was 470.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L703] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L705] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L707] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L709] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L835] 0 pthread_t t1229; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L836] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L837] 0 pthread_t t1230; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L838] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L839] 0 pthread_t t1231; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L840] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L841] 0 pthread_t t1232; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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] [L842] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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=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] [L804] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=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] [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L756] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L771] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2, 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] [L774] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=2, 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] [L777] 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) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] 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) [L777] 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) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 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 [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 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 [L813] 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) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] 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) [L813] 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) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 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 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 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 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_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=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y=2, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 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) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] 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) [L848] 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) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 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 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 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 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] 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) [L859] 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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] EXPR 0 !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) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_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=255, x=1, y=2, 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] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_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=255, x=1, y=2, 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] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p0_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=255, x=1, y=2, 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, 111 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: 30.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 828 SDtfs, 903 SDslu, 3072 SDs, 0 SdLazy, 2837 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1212occurred in iteration=15, 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.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1380 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 469054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...