/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:26:15,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:26:15,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:26:15,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:26:15,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:26:15,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:26:15,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:26:15,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:26:15,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:26:15,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:26:15,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:26:15,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:26:15,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:26:15,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:26:15,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:26:15,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:26:15,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:26:15,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:26:15,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:26:15,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:26:15,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:26:15,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:26:15,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:26:15,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:26:15,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:26:15,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:26:15,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:26:15,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:26:15,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:26:15,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:26:15,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:26:15,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:26:15,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:26:15,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:26:15,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:26:15,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:26:15,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:26:15,124 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:26:15,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:26:15,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:26:15,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:26:15,128 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:26:15,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:26:15,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:26:15,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:26:15,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:26:15,171 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:26:15,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:26:15,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:26:15,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:26:15,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:26:15,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:26:15,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:26:15,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:26:15,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:26:15,175 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:26:15,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:26:15,175 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:26:15,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:26:15,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:26:15,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:26:15,176 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:26:15,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:26:15,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:26:15,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:26:15,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:26:15,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:26:15,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:26:15,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:26:15,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:26:15,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:26:15,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:26:15,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:26:15,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:26:15,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:26:15,467 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:26:15,467 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:26:15,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-11 18:26:15,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26465987/d1f6e52734584143a4c8e86ce6bf9cac/FLAG3c21265d7 [2020-10-11 18:26:16,053 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:26:16,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2020-10-11 18:26:16,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26465987/d1f6e52734584143a4c8e86ce6bf9cac/FLAG3c21265d7 [2020-10-11 18:26:16,328 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f26465987/d1f6e52734584143a4c8e86ce6bf9cac [2020-10-11 18:26:16,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:26:16,338 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:26:16,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:26:16,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:26:16,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:26:16,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:16" (1/1) ... [2020-10-11 18:26:16,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e464cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:16, skipping insertion in model container [2020-10-11 18:26:16,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:26:16" (1/1) ... [2020-10-11 18:26:16,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:26:16,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:26:16,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:26:16,972 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:26:17,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:26:17,111 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:26:17,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17 WrapperNode [2020-10-11 18:26:17,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:26:17,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:26:17,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:26:17,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:26:17,122 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:26:17" (1/1) ... [2020-10-11 18:26:17,142 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:26:17" (1/1) ... [2020-10-11 18:26:17,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:26:17,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:26:17,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:26:17,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:26:17,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (1/1) ... [2020-10-11 18:26:17,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:26:17,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:26:17,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:26:17,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:26:17,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (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:26:17,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:26:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:26:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:26:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:26:17,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:26:17,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:26:17,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:26:17,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:26:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:26:17,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:26:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:26:17,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:26:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:26:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:26:17,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:26:17,307 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:26:19,211 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:26:19,211 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:26:19,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:19 BoogieIcfgContainer [2020-10-11 18:26:19,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:26:19,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:26:19,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:26:19,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:26:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:26:16" (1/3) ... [2020-10-11 18:26:19,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd166a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:19, skipping insertion in model container [2020-10-11 18:26:19,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:26:17" (2/3) ... [2020-10-11 18:26:19,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdd166a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:26:19, skipping insertion in model container [2020-10-11 18:26:19,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:26:19" (3/3) ... [2020-10-11 18:26:19,222 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2020-10-11 18:26:19,233 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:26:19,244 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:26:19,245 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:26:19,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,297 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,299 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,300 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,301 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,317 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,319 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,320 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:26:19,343 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:26:19,365 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:26:19,365 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:26:19,365 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:26:19,365 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:26:19,365 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:26:19,366 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:26:19,366 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:26:19,367 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:26:19,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-11 18:26:19,464 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-11 18:26:19,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:19,472 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-11 18:26:19,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow [2020-10-11 18:26:19,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow [2020-10-11 18:26:19,519 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2020-10-11 18:26:19,519 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:19,520 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:19,521 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] [2020-10-11 18:26:19,522 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:26:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1614687930, now seen corresponding path program 1 times [2020-10-11 18:26:19,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:19,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599032367] [2020-10-11 18:26:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:19,985 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:26:19,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599032367] [2020-10-11 18:26:19,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:19,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:26:19,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232950874] [2020-10-11 18:26:19,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:26:19,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:26:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:26:20,128 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 107 [2020-10-11 18:26:20,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states. [2020-10-11 18:26:20,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:20,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 107 [2020-10-11 18:26:20,132 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:20,164 INFO L129 PetriNetUnfolder]: 0/100 cut-off events. [2020-10-11 18:26:20,165 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:20,165 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 100 events. 0/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 4/102 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:26:20,167 INFO L132 encePairwiseOnDemand]: 102/107 looper letters, 0 selfloop transitions, 2 changer transitions 13/100 dead transitions. [2020-10-11 18:26:20,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 100 transitions, 216 flow [2020-10-11 18:26:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:26:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:26:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2020-10-11 18:26:20,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9750778816199377 [2020-10-11 18:26:20,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2020-10-11 18:26:20,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2020-10-11 18:26:20,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:20,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2020-10-11 18:26:20,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:26:20,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:26:20,200 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:26:20,203 INFO L185 Difference]: Start difference. First operand has 114 places, 103 transitions, 218 flow. Second operand 3 states and 313 transitions. [2020-10-11 18:26:20,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 100 transitions, 216 flow [2020-10-11 18:26:20,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:20,213 INFO L241 Difference]: Finished difference. Result has 111 places, 87 transitions, 186 flow [2020-10-11 18:26:20,216 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=111, PETRI_TRANSITIONS=87} [2020-10-11 18:26:20,217 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2020-10-11 18:26:20,217 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 186 flow [2020-10-11 18:26:20,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:26:20,217 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:20,217 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] [2020-10-11 18:26:20,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:26:20,218 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:26:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 343442451, now seen corresponding path program 1 times [2020-10-11 18:26:20,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:20,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918554483] [2020-10-11 18:26:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:20,545 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:26:20,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918554483] [2020-10-11 18:26:20,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:20,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:20,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825765407] [2020-10-11 18:26:20,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:20,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:20,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:20,673 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:20,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 186 flow. Second operand 6 states. [2020-10-11 18:26:20,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:20,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:20,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:20,825 INFO L129 PetriNetUnfolder]: 24/158 cut-off events. [2020-10-11 18:26:20,826 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:26:20,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 158 events. 24/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 421 event pairs, 5 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 191. Up to 31 conditions per place. [2020-10-11 18:26:20,828 INFO L132 encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/108 dead transitions. [2020-10-11 18:26:20,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 288 flow [2020-10-11 18:26:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2020-10-11 18:26:20,835 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9304257528556594 [2020-10-11 18:26:20,835 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2020-10-11 18:26:20,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2020-10-11 18:26:20,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:20,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2020-10-11 18:26:20,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:20,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:20,843 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:20,844 INFO L185 Difference]: Start difference. First operand has 111 places, 87 transitions, 186 flow. Second operand 9 states and 896 transitions. [2020-10-11 18:26:20,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 288 flow [2020-10-11 18:26:20,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 108 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:26:20,848 INFO L241 Difference]: Finished difference. Result has 111 places, 89 transitions, 225 flow [2020-10-11 18:26:20,849 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=225, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2020-10-11 18:26:20,850 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2020-10-11 18:26:20,850 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 89 transitions, 225 flow [2020-10-11 18:26:20,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:20,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:20,850 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] [2020-10-11 18:26:20,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:26:20,851 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:26:20,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:20,851 INFO L82 PathProgramCache]: Analyzing trace with hash 742380052, now seen corresponding path program 1 times [2020-10-11 18:26:20,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:20,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486251363] [2020-10-11 18:26:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:21,025 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:26:21,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486251363] [2020-10-11 18:26:21,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:21,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:21,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857891583] [2020-10-11 18:26:21,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:21,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:21,214 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:21,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 89 transitions, 225 flow. Second operand 6 states. [2020-10-11 18:26:21,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:21,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:21,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:21,438 INFO L129 PetriNetUnfolder]: 79/324 cut-off events. [2020-10-11 18:26:21,439 INFO L130 PetriNetUnfolder]: For 264/272 co-relation queries the response was YES. [2020-10-11 18:26:21,446 INFO L80 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 324 events. 79/324 cut-off events. For 264/272 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1524 event pairs, 18 based on Foata normal form. 10/324 useless extension candidates. Maximal degree in co-relation 636. Up to 64 conditions per place. [2020-10-11 18:26:21,451 INFO L132 encePairwiseOnDemand]: 100/107 looper letters, 8 selfloop transitions, 3 changer transitions 19/110 dead transitions. [2020-10-11 18:26:21,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 345 flow [2020-10-11 18:26:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2020-10-11 18:26:21,456 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9304257528556594 [2020-10-11 18:26:21,456 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2020-10-11 18:26:21,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2020-10-11 18:26:21,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:21,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2020-10-11 18:26:21,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:21,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:21,461 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:21,461 INFO L185 Difference]: Start difference. First operand has 111 places, 89 transitions, 225 flow. Second operand 9 states and 896 transitions. [2020-10-11 18:26:21,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 345 flow [2020-10-11 18:26:21,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 328 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:21,474 INFO L241 Difference]: Finished difference. Result has 116 places, 91 transitions, 259 flow [2020-10-11 18:26:21,474 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=116, PETRI_TRANSITIONS=91} [2020-10-11 18:26:21,479 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2020-10-11 18:26:21,480 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 91 transitions, 259 flow [2020-10-11 18:26:21,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:21,480 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:21,486 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:26:21,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:26:21,487 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:26:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:21,487 INFO L82 PathProgramCache]: Analyzing trace with hash -408379412, now seen corresponding path program 1 times [2020-10-11 18:26:21,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:21,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141618720] [2020-10-11 18:26:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:21,692 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:26:21,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141618720] [2020-10-11 18:26:21,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:21,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:21,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304128850] [2020-10-11 18:26:21,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:21,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:21,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:21,797 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:21,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 91 transitions, 259 flow. Second operand 6 states. [2020-10-11 18:26:21,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:21,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:21,798 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:21,987 INFO L129 PetriNetUnfolder]: 34/264 cut-off events. [2020-10-11 18:26:21,987 INFO L130 PetriNetUnfolder]: For 433/496 co-relation queries the response was YES. [2020-10-11 18:26:21,991 INFO L80 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 264 events. 34/264 cut-off events. For 433/496 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1215 event pairs, 4 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 611. Up to 36 conditions per place. [2020-10-11 18:26:21,993 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 12 selfloop transitions, 3 changer transitions 10/105 dead transitions. [2020-10-11 18:26:21,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 105 transitions, 407 flow [2020-10-11 18:26:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:26:21,997 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241952232606438 [2020-10-11 18:26:21,997 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:26:21,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:26:21,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:21,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:26:22,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:22,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:22,003 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:22,003 INFO L185 Difference]: Start difference. First operand has 116 places, 91 transitions, 259 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:26:22,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 105 transitions, 407 flow [2020-10-11 18:26:22,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 105 transitions, 376 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:22,012 INFO L241 Difference]: Finished difference. Result has 121 places, 91 transitions, 271 flow [2020-10-11 18:26:22,013 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=121, PETRI_TRANSITIONS=91} [2020-10-11 18:26:22,013 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2020-10-11 18:26:22,013 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 271 flow [2020-10-11 18:26:22,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:22,014 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:22,014 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] [2020-10-11 18:26:22,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:26:22,015 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:26:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash 419512145, now seen corresponding path program 1 times [2020-10-11 18:26:22,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:22,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169207094] [2020-10-11 18:26:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:22,337 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:26:22,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169207094] [2020-10-11 18:26:22,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:22,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:26:22,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417329572] [2020-10-11 18:26:22,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:26:22,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:22,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:26:22,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:26:22,959 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:22,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 271 flow. Second operand 10 states. [2020-10-11 18:26:22,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:22,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:22,961 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:23,843 INFO L129 PetriNetUnfolder]: 844/1866 cut-off events. [2020-10-11 18:26:23,843 INFO L130 PetriNetUnfolder]: For 5661/5782 co-relation queries the response was YES. [2020-10-11 18:26:23,864 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5694 conditions, 1866 events. 844/1866 cut-off events. For 5661/5782 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13919 event pairs, 400 based on Foata normal form. 63/1848 useless extension candidates. Maximal degree in co-relation 5631. Up to 677 conditions per place. [2020-10-11 18:26:23,880 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 12 selfloop transitions, 10 changer transitions 34/132 dead transitions. [2020-10-11 18:26:23,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 525 flow [2020-10-11 18:26:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:26:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:26:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1394 transitions. [2020-10-11 18:26:23,887 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8685358255451714 [2020-10-11 18:26:23,887 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1394 transitions. [2020-10-11 18:26:23,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1394 transitions. [2020-10-11 18:26:23,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:23,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1394 transitions. [2020-10-11 18:26:23,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:26:23,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:26:23,895 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:26:23,895 INFO L185 Difference]: Start difference. First operand has 121 places, 91 transitions, 271 flow. Second operand 15 states and 1394 transitions. [2020-10-11 18:26:23,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 525 flow [2020-10-11 18:26:23,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 132 transitions, 480 flow, removed 21 selfloop flow, removed 7 redundant places. [2020-10-11 18:26:23,925 INFO L241 Difference]: Finished difference. Result has 133 places, 97 transitions, 340 flow [2020-10-11 18:26:23,925 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=340, PETRI_PLACES=133, PETRI_TRANSITIONS=97} [2020-10-11 18:26:23,926 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 19 predicate places. [2020-10-11 18:26:23,926 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 97 transitions, 340 flow [2020-10-11 18:26:23,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:26:23,926 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:23,926 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] [2020-10-11 18:26:23,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:26:23,927 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:26:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash 803705807, now seen corresponding path program 1 times [2020-10-11 18:26:23,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:23,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162013426] [2020-10-11 18:26:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:24,201 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:26:24,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162013426] [2020-10-11 18:26:24,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:24,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:26:24,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317410282] [2020-10-11 18:26:24,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:26:24,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:24,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:26:24,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:26:24,485 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107 [2020-10-11 18:26:24,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 97 transitions, 340 flow. Second operand 9 states. [2020-10-11 18:26:24,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:24,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107 [2020-10-11 18:26:24,487 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:25,043 INFO L129 PetriNetUnfolder]: 616/1407 cut-off events. [2020-10-11 18:26:25,043 INFO L130 PetriNetUnfolder]: For 6203/6296 co-relation queries the response was YES. [2020-10-11 18:26:25,059 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 1407 events. 616/1407 cut-off events. For 6203/6296 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9662 event pairs, 156 based on Foata normal form. 48/1401 useless extension candidates. Maximal degree in co-relation 5369. Up to 500 conditions per place. [2020-10-11 18:26:25,072 INFO L132 encePairwiseOnDemand]: 99/107 looper letters, 18 selfloop transitions, 5 changer transitions 19/119 dead transitions. [2020-10-11 18:26:25,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 119 transitions, 570 flow [2020-10-11 18:26:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:26:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:26:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1030 transitions. [2020-10-11 18:26:25,078 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8751062022090059 [2020-10-11 18:26:25,078 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1030 transitions. [2020-10-11 18:26:25,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1030 transitions. [2020-10-11 18:26:25,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:25,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1030 transitions. [2020-10-11 18:26:25,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:26:25,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:26:25,085 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:26:25,086 INFO L185 Difference]: Start difference. First operand has 133 places, 97 transitions, 340 flow. Second operand 11 states and 1030 transitions. [2020-10-11 18:26:25,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 119 transitions, 570 flow [2020-10-11 18:26:25,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 119 transitions, 544 flow, removed 11 selfloop flow, removed 5 redundant places. [2020-10-11 18:26:25,097 INFO L241 Difference]: Finished difference. Result has 136 places, 97 transitions, 354 flow [2020-10-11 18:26:25,098 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=354, PETRI_PLACES=136, PETRI_TRANSITIONS=97} [2020-10-11 18:26:25,098 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2020-10-11 18:26:25,098 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 97 transitions, 354 flow [2020-10-11 18:26:25,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:26:25,098 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:25,099 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] [2020-10-11 18:26:25,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:26:25,099 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:26:25,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1552759475, now seen corresponding path program 1 times [2020-10-11 18:26:25,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:25,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339899897] [2020-10-11 18:26:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:25,380 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:26:25,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339899897] [2020-10-11 18:26:25,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:25,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:25,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676165784] [2020-10-11 18:26:25,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:25,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:25,997 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:25,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 97 transitions, 354 flow. Second operand 11 states. [2020-10-11 18:26:25,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:25,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:25,998 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:26,603 INFO L129 PetriNetUnfolder]: 518/1339 cut-off events. [2020-10-11 18:26:26,604 INFO L130 PetriNetUnfolder]: For 6745/6834 co-relation queries the response was YES. [2020-10-11 18:26:26,616 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 1339 events. 518/1339 cut-off events. For 6745/6834 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9886 event pairs, 230 based on Foata normal form. 49/1331 useless extension candidates. Maximal degree in co-relation 4925. Up to 412 conditions per place. [2020-10-11 18:26:26,625 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 13 selfloop transitions, 11 changer transitions 23/122 dead transitions. [2020-10-11 18:26:26,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 630 flow [2020-10-11 18:26:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1278 transitions. [2020-10-11 18:26:26,630 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8531375166889186 [2020-10-11 18:26:26,630 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1278 transitions. [2020-10-11 18:26:26,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1278 transitions. [2020-10-11 18:26:26,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:26,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1278 transitions. [2020-10-11 18:26:26,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:26,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:26,637 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:26,637 INFO L185 Difference]: Start difference. First operand has 136 places, 97 transitions, 354 flow. Second operand 14 states and 1278 transitions. [2020-10-11 18:26:26,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 630 flow [2020-10-11 18:26:26,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 122 transitions, 574 flow, removed 24 selfloop flow, removed 12 redundant places. [2020-10-11 18:26:26,650 INFO L241 Difference]: Finished difference. Result has 138 places, 98 transitions, 382 flow [2020-10-11 18:26:26,650 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=382, PETRI_PLACES=138, PETRI_TRANSITIONS=98} [2020-10-11 18:26:26,650 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 24 predicate places. [2020-10-11 18:26:26,650 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 98 transitions, 382 flow [2020-10-11 18:26:26,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:26,651 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:26,651 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:26:26,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:26:26,651 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:26:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1724275627, now seen corresponding path program 1 times [2020-10-11 18:26:26,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:26,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816009913] [2020-10-11 18:26:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:26,977 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:26:26,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816009913] [2020-10-11 18:26:26,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:26,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:26:26,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018368724] [2020-10-11 18:26:26,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:26:26,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:26:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:26:27,889 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107 [2020-10-11 18:26:27,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 98 transitions, 382 flow. Second operand 10 states. [2020-10-11 18:26:27,890 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:27,890 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107 [2020-10-11 18:26:27,890 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:28,480 INFO L129 PetriNetUnfolder]: 446/1097 cut-off events. [2020-10-11 18:26:28,480 INFO L130 PetriNetUnfolder]: For 7664/7744 co-relation queries the response was YES. [2020-10-11 18:26:28,495 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4865 conditions, 1097 events. 446/1097 cut-off events. For 7664/7744 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7355 event pairs, 152 based on Foata normal form. 34/1086 useless extension candidates. Maximal degree in co-relation 4787. Up to 408 conditions per place. [2020-10-11 18:26:28,508 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 18 selfloop transitions, 11 changer transitions 10/116 dead transitions. [2020-10-11 18:26:28,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 116 transitions, 602 flow [2020-10-11 18:26:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions. [2020-10-11 18:26:28,514 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8764278296988577 [2020-10-11 18:26:28,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 844 transitions. [2020-10-11 18:26:28,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions. [2020-10-11 18:26:28,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:28,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions. [2020-10-11 18:26:28,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:28,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:28,522 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:28,522 INFO L185 Difference]: Start difference. First operand has 138 places, 98 transitions, 382 flow. Second operand 9 states and 844 transitions. [2020-10-11 18:26:28,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 116 transitions, 602 flow [2020-10-11 18:26:28,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 116 transitions, 569 flow, removed 8 selfloop flow, removed 9 redundant places. [2020-10-11 18:26:28,544 INFO L241 Difference]: Finished difference. Result has 136 places, 104 transitions, 435 flow [2020-10-11 18:26:28,544 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=435, PETRI_PLACES=136, PETRI_TRANSITIONS=104} [2020-10-11 18:26:28,545 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2020-10-11 18:26:28,545 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 104 transitions, 435 flow [2020-10-11 18:26:28,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:26:28,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:28,546 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:26:28,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:26:28,546 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:26:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1007328359, now seen corresponding path program 2 times [2020-10-11 18:26:28,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:28,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979475642] [2020-10-11 18:26:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:28,844 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:26:28,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979475642] [2020-10-11 18:26:28,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:28,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:28,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738228255] [2020-10-11 18:26:28,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:28,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:30,185 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:30,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 104 transitions, 435 flow. Second operand 11 states. [2020-10-11 18:26:30,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:30,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:30,187 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:30,887 INFO L129 PetriNetUnfolder]: 449/1097 cut-off events. [2020-10-11 18:26:30,887 INFO L130 PetriNetUnfolder]: For 8920/9114 co-relation queries the response was YES. [2020-10-11 18:26:30,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5390 conditions, 1097 events. 449/1097 cut-off events. For 8920/9114 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7267 event pairs, 113 based on Foata normal form. 44/1098 useless extension candidates. Maximal degree in co-relation 5312. Up to 411 conditions per place. [2020-10-11 18:26:30,909 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 19 selfloop transitions, 13 changer transitions 19/127 dead transitions. [2020-10-11 18:26:30,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 127 transitions, 803 flow [2020-10-11 18:26:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1202 transitions. [2020-10-11 18:26:30,914 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8641265276779295 [2020-10-11 18:26:30,914 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1202 transitions. [2020-10-11 18:26:30,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1202 transitions. [2020-10-11 18:26:30,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:30,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1202 transitions. [2020-10-11 18:26:30,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:30,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:30,920 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:30,920 INFO L185 Difference]: Start difference. First operand has 136 places, 104 transitions, 435 flow. Second operand 13 states and 1202 transitions. [2020-10-11 18:26:30,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 127 transitions, 803 flow [2020-10-11 18:26:30,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 127 transitions, 699 flow, removed 48 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:30,934 INFO L241 Difference]: Finished difference. Result has 144 places, 106 transitions, 470 flow [2020-10-11 18:26:30,934 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=470, PETRI_PLACES=144, PETRI_TRANSITIONS=106} [2020-10-11 18:26:30,935 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 30 predicate places. [2020-10-11 18:26:30,935 INFO L481 AbstractCegarLoop]: Abstraction has has 144 places, 106 transitions, 470 flow [2020-10-11 18:26:30,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:30,935 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:30,935 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:26:30,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:26:30,935 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:26:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1725179555, now seen corresponding path program 3 times [2020-10-11 18:26:30,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:30,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516751272] [2020-10-11 18:26:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:31,241 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:26:31,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516751272] [2020-10-11 18:26:31,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:31,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:26:31,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655745347] [2020-10-11 18:26:31,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:26:31,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:31,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:26:31,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:26:32,473 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2020-10-11 18:26:32,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 106 transitions, 470 flow. Second operand 11 states. [2020-10-11 18:26:32,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:32,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2020-10-11 18:26:32,474 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:33,074 INFO L129 PetriNetUnfolder]: 452/1166 cut-off events. [2020-10-11 18:26:33,074 INFO L130 PetriNetUnfolder]: For 10731/10908 co-relation queries the response was YES. [2020-10-11 18:26:33,088 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 1166 events. 452/1166 cut-off events. For 10731/10908 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8165 event pairs, 104 based on Foata normal form. 44/1170 useless extension candidates. Maximal degree in co-relation 6065. Up to 414 conditions per place. [2020-10-11 18:26:33,100 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 19 selfloop transitions, 16 changer transitions 19/130 dead transitions. [2020-10-11 18:26:33,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 130 transitions, 931 flow [2020-10-11 18:26:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1201 transitions. [2020-10-11 18:26:33,105 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8634076204169662 [2020-10-11 18:26:33,105 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1201 transitions. [2020-10-11 18:26:33,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1201 transitions. [2020-10-11 18:26:33,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:33,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1201 transitions. [2020-10-11 18:26:33,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:33,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:33,111 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:33,112 INFO L185 Difference]: Start difference. First operand has 144 places, 106 transitions, 470 flow. Second operand 13 states and 1201 transitions. [2020-10-11 18:26:33,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 130 transitions, 931 flow [2020-10-11 18:26:33,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 130 transitions, 882 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:33,129 INFO L241 Difference]: Finished difference. Result has 149 places, 110 transitions, 550 flow [2020-10-11 18:26:33,129 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=550, PETRI_PLACES=149, PETRI_TRANSITIONS=110} [2020-10-11 18:26:33,129 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 35 predicate places. [2020-10-11 18:26:33,130 INFO L481 AbstractCegarLoop]: Abstraction has has 149 places, 110 transitions, 550 flow [2020-10-11 18:26:33,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:26:33,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:33,130 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:26:33,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:26:33,131 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:26:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1323810481, now seen corresponding path program 4 times [2020-10-11 18:26:33,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:33,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657667239] [2020-10-11 18:26:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:33,414 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:26:33,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657667239] [2020-10-11 18:26:33,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:33,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:26:33,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440628786] [2020-10-11 18:26:33,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:26:33,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:33,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:26:33,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:26:34,648 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107 [2020-10-11 18:26:34,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 110 transitions, 550 flow. Second operand 10 states. [2020-10-11 18:26:34,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:34,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107 [2020-10-11 18:26:34,649 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:35,163 INFO L129 PetriNetUnfolder]: 432/1185 cut-off events. [2020-10-11 18:26:35,163 INFO L130 PetriNetUnfolder]: For 15767/15837 co-relation queries the response was YES. [2020-10-11 18:26:35,173 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 1185 events. 432/1185 cut-off events. For 15767/15837 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8681 event pairs, 108 based on Foata normal form. 38/1182 useless extension candidates. Maximal degree in co-relation 6737. Up to 331 conditions per place. [2020-10-11 18:26:35,182 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 25 selfloop transitions, 11 changer transitions 19/135 dead transitions. [2020-10-11 18:26:35,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 135 transitions, 1108 flow [2020-10-11 18:26:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2020-10-11 18:26:35,188 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8746105919003115 [2020-10-11 18:26:35,188 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1123 transitions. [2020-10-11 18:26:35,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1123 transitions. [2020-10-11 18:26:35,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:35,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1123 transitions. [2020-10-11 18:26:35,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:35,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:35,193 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:35,193 INFO L185 Difference]: Start difference. First operand has 149 places, 110 transitions, 550 flow. Second operand 12 states and 1123 transitions. [2020-10-11 18:26:35,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 135 transitions, 1108 flow [2020-10-11 18:26:35,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 135 transitions, 983 flow, removed 61 selfloop flow, removed 8 redundant places. [2020-10-11 18:26:35,219 INFO L241 Difference]: Finished difference. Result has 153 places, 112 transitions, 592 flow [2020-10-11 18:26:35,220 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=592, PETRI_PLACES=153, PETRI_TRANSITIONS=112} [2020-10-11 18:26:35,220 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2020-10-11 18:26:35,220 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 112 transitions, 592 flow [2020-10-11 18:26:35,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:26:35,220 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:35,220 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] [2020-10-11 18:26:35,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:26:35,221 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:26:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 158019152, now seen corresponding path program 1 times [2020-10-11 18:26:35,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:35,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215754648] [2020-10-11 18:26:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:35,549 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:26:35,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215754648] [2020-10-11 18:26:35,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:35,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:35,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035914618] [2020-10-11 18:26:35,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:35,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:35,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:36,956 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 107 [2020-10-11 18:26:36,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 112 transitions, 592 flow. Second operand 12 states. [2020-10-11 18:26:36,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:36,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 107 [2020-10-11 18:26:36,957 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:37,298 INFO L129 PetriNetUnfolder]: 342/895 cut-off events. [2020-10-11 18:26:37,299 INFO L130 PetriNetUnfolder]: For 14767/15001 co-relation queries the response was YES. [2020-10-11 18:26:37,305 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5670 conditions, 895 events. 342/895 cut-off events. For 14767/15001 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5671 event pairs, 124 based on Foata normal form. 30/888 useless extension candidates. Maximal degree in co-relation 5581. Up to 392 conditions per place. [2020-10-11 18:26:37,315 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 27 selfloop transitions, 16 changer transitions 7/124 dead transitions. [2020-10-11 18:26:37,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 124 transitions, 907 flow [2020-10-11 18:26:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:26:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:26:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 991 transitions. [2020-10-11 18:26:37,320 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8419711129991504 [2020-10-11 18:26:37,320 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 991 transitions. [2020-10-11 18:26:37,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 991 transitions. [2020-10-11 18:26:37,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:37,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 991 transitions. [2020-10-11 18:26:37,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:26:37,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:26:37,324 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:26:37,325 INFO L185 Difference]: Start difference. First operand has 153 places, 112 transitions, 592 flow. Second operand 11 states and 991 transitions. [2020-10-11 18:26:37,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 124 transitions, 907 flow [2020-10-11 18:26:37,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 124 transitions, 832 flow, removed 33 selfloop flow, removed 9 redundant places. [2020-10-11 18:26:37,340 INFO L241 Difference]: Finished difference. Result has 153 places, 116 transitions, 657 flow [2020-10-11 18:26:37,340 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=657, PETRI_PLACES=153, PETRI_TRANSITIONS=116} [2020-10-11 18:26:37,341 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2020-10-11 18:26:37,341 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 116 transitions, 657 flow [2020-10-11 18:26:37,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:37,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:37,341 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] [2020-10-11 18:26:37,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:26:37,342 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:26:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1921354224, now seen corresponding path program 2 times [2020-10-11 18:26:37,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:37,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497521276] [2020-10-11 18:26:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:37,605 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:26:37,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497521276] [2020-10-11 18:26:37,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:37,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:37,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873619954] [2020-10-11 18:26:37,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:37,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:38,421 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:38,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 116 transitions, 657 flow. Second operand 12 states. [2020-10-11 18:26:38,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:38,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:38,422 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:38,888 INFO L129 PetriNetUnfolder]: 328/1083 cut-off events. [2020-10-11 18:26:38,888 INFO L130 PetriNetUnfolder]: For 12819/13305 co-relation queries the response was YES. [2020-10-11 18:26:38,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5847 conditions, 1083 events. 328/1083 cut-off events. For 12819/13305 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8117 event pairs, 57 based on Foata normal form. 32/1075 useless extension candidates. Maximal degree in co-relation 5758. Up to 303 conditions per place. [2020-10-11 18:26:38,909 INFO L132 encePairwiseOnDemand]: 96/107 looper letters, 32 selfloop transitions, 19 changer transitions 10/136 dead transitions. [2020-10-11 18:26:38,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 136 transitions, 1109 flow [2020-10-11 18:26:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1184 transitions. [2020-10-11 18:26:38,912 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8511861969805895 [2020-10-11 18:26:38,912 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1184 transitions. [2020-10-11 18:26:38,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1184 transitions. [2020-10-11 18:26:38,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:38,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1184 transitions. [2020-10-11 18:26:38,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:38,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:38,918 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:38,918 INFO L185 Difference]: Start difference. First operand has 153 places, 116 transitions, 657 flow. Second operand 13 states and 1184 transitions. [2020-10-11 18:26:38,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 136 transitions, 1109 flow [2020-10-11 18:26:38,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 136 transitions, 1049 flow, removed 23 selfloop flow, removed 7 redundant places. [2020-10-11 18:26:38,940 INFO L241 Difference]: Finished difference. Result has 163 places, 121 transitions, 804 flow [2020-10-11 18:26:38,941 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=804, PETRI_PLACES=163, PETRI_TRANSITIONS=121} [2020-10-11 18:26:38,941 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 49 predicate places. [2020-10-11 18:26:38,941 INFO L481 AbstractCegarLoop]: Abstraction has has 163 places, 121 transitions, 804 flow [2020-10-11 18:26:38,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:38,941 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:38,941 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] [2020-10-11 18:26:38,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:26:38,942 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:26:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:38,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1203503028, now seen corresponding path program 3 times [2020-10-11 18:26:38,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:38,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899705977] [2020-10-11 18:26:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:39,195 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:26:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899705977] [2020-10-11 18:26:39,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:39,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:39,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273223053] [2020-10-11 18:26:39,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:39,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:40,344 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:40,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 121 transitions, 804 flow. Second operand 12 states. [2020-10-11 18:26:40,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:40,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:40,345 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:40,960 INFO L129 PetriNetUnfolder]: 347/1052 cut-off events. [2020-10-11 18:26:40,961 INFO L130 PetriNetUnfolder]: For 16071/16706 co-relation queries the response was YES. [2020-10-11 18:26:40,968 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6410 conditions, 1052 events. 347/1052 cut-off events. For 16071/16706 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7576 event pairs, 86 based on Foata normal form. 48/1062 useless extension candidates. Maximal degree in co-relation 6316. Up to 383 conditions per place. [2020-10-11 18:26:40,974 INFO L132 encePairwiseOnDemand]: 95/107 looper letters, 33 selfloop transitions, 24 changer transitions 10/142 dead transitions. [2020-10-11 18:26:40,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 142 transitions, 1286 flow [2020-10-11 18:26:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:26:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:26:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1275 transitions. [2020-10-11 18:26:40,976 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8511348464619493 [2020-10-11 18:26:40,977 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1275 transitions. [2020-10-11 18:26:40,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1275 transitions. [2020-10-11 18:26:40,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:40,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1275 transitions. [2020-10-11 18:26:40,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:26:40,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:26:40,982 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:26:40,982 INFO L185 Difference]: Start difference. First operand has 163 places, 121 transitions, 804 flow. Second operand 14 states and 1275 transitions. [2020-10-11 18:26:40,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 142 transitions, 1286 flow [2020-10-11 18:26:41,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 142 transitions, 1169 flow, removed 56 selfloop flow, removed 9 redundant places. [2020-10-11 18:26:41,011 INFO L241 Difference]: Finished difference. Result has 169 places, 126 transitions, 918 flow [2020-10-11 18:26:41,011 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=918, PETRI_PLACES=169, PETRI_TRANSITIONS=126} [2020-10-11 18:26:41,012 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 55 predicate places. [2020-10-11 18:26:41,012 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 126 transitions, 918 flow [2020-10-11 18:26:41,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:41,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:41,012 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] [2020-10-11 18:26:41,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:26:41,013 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:26:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash 998754728, now seen corresponding path program 4 times [2020-10-11 18:26:41,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:41,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841567452] [2020-10-11 18:26:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:41,414 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:26:41,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841567452] [2020-10-11 18:26:41,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:41,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:26:41,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825039839] [2020-10-11 18:26:41,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:26:41,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:26:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:26:43,294 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2020-10-11 18:26:43,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 126 transitions, 918 flow. Second operand 13 states. [2020-10-11 18:26:43,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:43,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2020-10-11 18:26:43,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:44,050 INFO L129 PetriNetUnfolder]: 367/1070 cut-off events. [2020-10-11 18:26:44,050 INFO L130 PetriNetUnfolder]: For 19730/20478 co-relation queries the response was YES. [2020-10-11 18:26:44,062 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 1070 events. 367/1070 cut-off events. For 19730/20478 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7573 event pairs, 125 based on Foata normal form. 59/1087 useless extension candidates. Maximal degree in co-relation 6857. Up to 445 conditions per place. [2020-10-11 18:26:44,071 INFO L132 encePairwiseOnDemand]: 94/107 looper letters, 32 selfloop transitions, 21 changer transitions 10/138 dead transitions. [2020-10-11 18:26:44,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 138 transitions, 1300 flow [2020-10-11 18:26:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:26:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:26:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1359 transitions. [2020-10-11 18:26:44,075 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8467289719626169 [2020-10-11 18:26:44,075 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1359 transitions. [2020-10-11 18:26:44,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1359 transitions. [2020-10-11 18:26:44,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:44,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1359 transitions. [2020-10-11 18:26:44,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:26:44,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:26:44,080 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:26:44,080 INFO L185 Difference]: Start difference. First operand has 169 places, 126 transitions, 918 flow. Second operand 15 states and 1359 transitions. [2020-10-11 18:26:44,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 138 transitions, 1300 flow [2020-10-11 18:26:44,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 138 transitions, 1181 flow, removed 54 selfloop flow, removed 10 redundant places. [2020-10-11 18:26:44,113 INFO L241 Difference]: Finished difference. Result has 174 places, 127 transitions, 956 flow [2020-10-11 18:26:44,113 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=956, PETRI_PLACES=174, PETRI_TRANSITIONS=127} [2020-10-11 18:26:44,113 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 60 predicate places. [2020-10-11 18:26:44,114 INFO L481 AbstractCegarLoop]: Abstraction has has 174 places, 127 transitions, 956 flow [2020-10-11 18:26:44,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:26:44,114 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:44,114 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] [2020-10-11 18:26:44,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:26:44,114 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:26:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:44,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1897094674, now seen corresponding path program 1 times [2020-10-11 18:26:44,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:44,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299346227] [2020-10-11 18:26:44,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:44,212 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:26:44,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299346227] [2020-10-11 18:26:44,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:44,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:44,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524857954] [2020-10-11 18:26:44,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:44,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:44,400 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:44,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 127 transitions, 956 flow. Second operand 6 states. [2020-10-11 18:26:44,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:44,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:44,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:45,702 INFO L129 PetriNetUnfolder]: 2842/6051 cut-off events. [2020-10-11 18:26:45,702 INFO L130 PetriNetUnfolder]: For 42755/43495 co-relation queries the response was YES. [2020-10-11 18:26:45,752 INFO L80 FinitePrefix]: Finished finitePrefix Result has 22649 conditions, 6051 events. 2842/6051 cut-off events. For 42755/43495 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 56846 event pairs, 389 based on Foata normal form. 117/5436 useless extension candidates. Maximal degree in co-relation 22553. Up to 1716 conditions per place. [2020-10-11 18:26:45,792 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 23 selfloop transitions, 19 changer transitions 0/158 dead transitions. [2020-10-11 18:26:45,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 158 transitions, 1102 flow [2020-10-11 18:26:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2020-10-11 18:26:45,795 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9148494288681205 [2020-10-11 18:26:45,795 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2020-10-11 18:26:45,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2020-10-11 18:26:45,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:45,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2020-10-11 18:26:45,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:45,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:45,799 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:45,799 INFO L185 Difference]: Start difference. First operand has 174 places, 127 transitions, 956 flow. Second operand 9 states and 881 transitions. [2020-10-11 18:26:45,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 158 transitions, 1102 flow [2020-10-11 18:26:45,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 1003 flow, removed 27 selfloop flow, removed 15 redundant places. [2020-10-11 18:26:45,894 INFO L241 Difference]: Finished difference. Result has 166 places, 144 transitions, 991 flow [2020-10-11 18:26:45,895 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=991, PETRI_PLACES=166, PETRI_TRANSITIONS=144} [2020-10-11 18:26:45,895 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 52 predicate places. [2020-10-11 18:26:45,895 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 144 transitions, 991 flow [2020-10-11 18:26:45,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:45,895 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:45,896 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:26:45,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:26:45,896 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:26:45,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1576757598, now seen corresponding path program 1 times [2020-10-11 18:26:45,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:45,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238355250] [2020-10-11 18:26:45,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:46,175 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:26:46,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238355250] [2020-10-11 18:26:46,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:46,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:26:46,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845250105] [2020-10-11 18:26:46,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:26:46,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:46,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:26:46,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:26:47,847 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 107 [2020-10-11 18:26:47,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 144 transitions, 991 flow. Second operand 12 states. [2020-10-11 18:26:47,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:47,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 107 [2020-10-11 18:26:47,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:48,790 INFO L129 PetriNetUnfolder]: 1321/4296 cut-off events. [2020-10-11 18:26:48,791 INFO L130 PetriNetUnfolder]: For 26566/29050 co-relation queries the response was YES. [2020-10-11 18:26:48,824 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17476 conditions, 4296 events. 1321/4296 cut-off events. For 26566/29050 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 45825 event pairs, 486 based on Foata normal form. 172/4018 useless extension candidates. Maximal degree in co-relation 17382. Up to 1298 conditions per place. [2020-10-11 18:26:48,853 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 33 selfloop transitions, 24 changer transitions 0/158 dead transitions. [2020-10-11 18:26:48,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 158 transitions, 1299 flow [2020-10-11 18:26:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:26:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:26:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1204 transitions. [2020-10-11 18:26:48,856 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8655643421998562 [2020-10-11 18:26:48,856 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1204 transitions. [2020-10-11 18:26:48,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1204 transitions. [2020-10-11 18:26:48,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:48,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1204 transitions. [2020-10-11 18:26:48,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:26:48,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:26:48,861 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:26:48,861 INFO L185 Difference]: Start difference. First operand has 166 places, 144 transitions, 991 flow. Second operand 13 states and 1204 transitions. [2020-10-11 18:26:48,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 158 transitions, 1299 flow [2020-10-11 18:26:48,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 158 transitions, 1283 flow, removed 7 selfloop flow, removed 1 redundant places. [2020-10-11 18:26:48,904 INFO L241 Difference]: Finished difference. Result has 184 places, 152 transitions, 1220 flow [2020-10-11 18:26:48,905 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1220, PETRI_PLACES=184, PETRI_TRANSITIONS=152} [2020-10-11 18:26:48,905 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 70 predicate places. [2020-10-11 18:26:48,905 INFO L481 AbstractCegarLoop]: Abstraction has has 184 places, 152 transitions, 1220 flow [2020-10-11 18:26:48,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:26:48,905 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:48,906 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:26:48,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:26:48,906 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:26:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1106613030, now seen corresponding path program 1 times [2020-10-11 18:26:48,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:48,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757385918] [2020-10-11 18:26:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:49,025 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:26:49,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757385918] [2020-10-11 18:26:49,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:49,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:49,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908152410] [2020-10-11 18:26:49,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:49,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:49,128 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:49,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 152 transitions, 1220 flow. Second operand 7 states. [2020-10-11 18:26:49,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:49,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:49,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:50,598 INFO L129 PetriNetUnfolder]: 2412/5355 cut-off events. [2020-10-11 18:26:50,598 INFO L130 PetriNetUnfolder]: For 31669/40941 co-relation queries the response was YES. [2020-10-11 18:26:50,637 INFO L80 FinitePrefix]: Finished finitePrefix Result has 23537 conditions, 5355 events. 2412/5355 cut-off events. For 31669/40941 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 50886 event pairs, 153 based on Foata normal form. 482/5186 useless extension candidates. Maximal degree in co-relation 23436. Up to 2396 conditions per place. [2020-10-11 18:26:50,665 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 25 selfloop transitions, 37 changer transitions 0/186 dead transitions. [2020-10-11 18:26:50,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 1573 flow [2020-10-11 18:26:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:26:50,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:26:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1176 transitions. [2020-10-11 18:26:50,668 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9158878504672897 [2020-10-11 18:26:50,668 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1176 transitions. [2020-10-11 18:26:50,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1176 transitions. [2020-10-11 18:26:50,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:50,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1176 transitions. [2020-10-11 18:26:50,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:26:50,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:26:50,672 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:26:50,672 INFO L185 Difference]: Start difference. First operand has 184 places, 152 transitions, 1220 flow. Second operand 12 states and 1176 transitions. [2020-10-11 18:26:50,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 1573 flow [2020-10-11 18:26:50,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 186 transitions, 1426 flow, removed 62 selfloop flow, removed 5 redundant places. [2020-10-11 18:26:50,743 INFO L241 Difference]: Finished difference. Result has 195 places, 171 transitions, 1353 flow [2020-10-11 18:26:50,743 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1353, PETRI_PLACES=195, PETRI_TRANSITIONS=171} [2020-10-11 18:26:50,743 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 81 predicate places. [2020-10-11 18:26:50,744 INFO L481 AbstractCegarLoop]: Abstraction has has 195 places, 171 transitions, 1353 flow [2020-10-11 18:26:50,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:26:50,744 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:50,744 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:26:50,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:26:50,744 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:26:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:50,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1859816485, now seen corresponding path program 1 times [2020-10-11 18:26:50,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:50,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578651992] [2020-10-11 18:26:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:50,846 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:26:50,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578651992] [2020-10-11 18:26:50,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:50,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:26:50,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914043908] [2020-10-11 18:26:50,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:26:50,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:26:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:26:50,984 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2020-10-11 18:26:50,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 171 transitions, 1353 flow. Second operand 6 states. [2020-10-11 18:26:50,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:50,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2020-10-11 18:26:50,985 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:52,097 INFO L129 PetriNetUnfolder]: 1833/5911 cut-off events. [2020-10-11 18:26:52,097 INFO L130 PetriNetUnfolder]: For 38109/50385 co-relation queries the response was YES. [2020-10-11 18:26:52,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 27389 conditions, 5911 events. 1833/5911 cut-off events. For 38109/50385 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 67017 event pairs, 306 based on Foata normal form. 164/5365 useless extension candidates. Maximal degree in co-relation 27284. Up to 2035 conditions per place. [2020-10-11 18:26:52,161 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 20 selfloop transitions, 16 changer transitions 9/199 dead transitions. [2020-10-11 18:26:52,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 1760 flow [2020-10-11 18:26:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:26:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:26:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2020-10-11 18:26:52,163 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9241952232606438 [2020-10-11 18:26:52,163 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2020-10-11 18:26:52,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2020-10-11 18:26:52,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:52,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2020-10-11 18:26:52,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:26:52,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:26:52,167 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:26:52,167 INFO L185 Difference]: Start difference. First operand has 195 places, 171 transitions, 1353 flow. Second operand 9 states and 890 transitions. [2020-10-11 18:26:52,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 1760 flow [2020-10-11 18:26:52,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 199 transitions, 1641 flow, removed 50 selfloop flow, removed 4 redundant places. [2020-10-11 18:26:52,317 INFO L241 Difference]: Finished difference. Result has 206 places, 184 transitions, 1501 flow [2020-10-11 18:26:52,318 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1501, PETRI_PLACES=206, PETRI_TRANSITIONS=184} [2020-10-11 18:26:52,318 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 92 predicate places. [2020-10-11 18:26:52,318 INFO L481 AbstractCegarLoop]: Abstraction has has 206 places, 184 transitions, 1501 flow [2020-10-11 18:26:52,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:26:52,318 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:52,318 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:26:52,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:26:52,319 INFO L429 AbstractCegarLoop]: === Iteration 20 === [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:26:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:52,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1347765595, now seen corresponding path program 1 times [2020-10-11 18:26:52,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:52,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718370200] [2020-10-11 18:26:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:52,452 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:26:52,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718370200] [2020-10-11 18:26:52,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:52,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:26:52,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205059003] [2020-10-11 18:26:52,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:26:52,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:26:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:26:52,682 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:52,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 184 transitions, 1501 flow. Second operand 8 states. [2020-10-11 18:26:52,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:52,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:52,683 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:54,891 INFO L129 PetriNetUnfolder]: 3195/6594 cut-off events. [2020-10-11 18:26:54,891 INFO L130 PetriNetUnfolder]: For 55776/73893 co-relation queries the response was YES. [2020-10-11 18:26:54,944 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33541 conditions, 6594 events. 3195/6594 cut-off events. For 55776/73893 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 63544 event pairs, 25 based on Foata normal form. 819/6453 useless extension candidates. Maximal degree in co-relation 33430. Up to 2876 conditions per place. [2020-10-11 18:26:54,961 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 19 selfloop transitions, 57 changer transitions 32/208 dead transitions. [2020-10-11 18:26:54,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 1920 flow [2020-10-11 18:26:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:26:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:26:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1471 transitions. [2020-10-11 18:26:54,964 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9165109034267913 [2020-10-11 18:26:54,965 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1471 transitions. [2020-10-11 18:26:54,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1471 transitions. [2020-10-11 18:26:54,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:54,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1471 transitions. [2020-10-11 18:26:54,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:26:54,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:26:54,969 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:26:54,969 INFO L185 Difference]: Start difference. First operand has 206 places, 184 transitions, 1501 flow. Second operand 15 states and 1471 transitions. [2020-10-11 18:26:54,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 1920 flow [2020-10-11 18:26:55,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 208 transitions, 1774 flow, removed 50 selfloop flow, removed 11 redundant places. [2020-10-11 18:26:55,125 INFO L241 Difference]: Finished difference. Result has 212 places, 172 transitions, 1375 flow [2020-10-11 18:26:55,126 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1375, PETRI_PLACES=212, PETRI_TRANSITIONS=172} [2020-10-11 18:26:55,126 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 98 predicate places. [2020-10-11 18:26:55,126 INFO L481 AbstractCegarLoop]: Abstraction has has 212 places, 172 transitions, 1375 flow [2020-10-11 18:26:55,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:26:55,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:55,127 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:26:55,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:26:55,127 INFO L429 AbstractCegarLoop]: === Iteration 21 === [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:26:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash 971642200, now seen corresponding path program 1 times [2020-10-11 18:26:55,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:55,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368941815] [2020-10-11 18:26:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:55,280 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:26:55,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368941815] [2020-10-11 18:26:55,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:55,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:26:55,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155030658] [2020-10-11 18:26:55,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:26:55,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:55,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:26:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:26:55,570 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2020-10-11 18:26:55,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 172 transitions, 1375 flow. Second operand 9 states. [2020-10-11 18:26:55,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:55,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2020-10-11 18:26:55,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:26:57,134 INFO L129 PetriNetUnfolder]: 2803/5853 cut-off events. [2020-10-11 18:26:57,135 INFO L130 PetriNetUnfolder]: For 61512/92078 co-relation queries the response was YES. [2020-10-11 18:26:57,176 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33048 conditions, 5853 events. 2803/5853 cut-off events. For 61512/92078 co-relation queries the response was YES. Maximal size of possible extension queue 1091. Compared 57827 event pairs, 0 based on Foata normal form. 859/5752 useless extension candidates. Maximal degree in co-relation 32979. Up to 2535 conditions per place. [2020-10-11 18:26:57,192 INFO L132 encePairwiseOnDemand]: 97/107 looper letters, 12 selfloop transitions, 63 changer transitions 22/189 dead transitions. [2020-10-11 18:26:57,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 189 transitions, 1720 flow [2020-10-11 18:26:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:26:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:26:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1750 transitions. [2020-10-11 18:26:57,195 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9086188992731049 [2020-10-11 18:26:57,196 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1750 transitions. [2020-10-11 18:26:57,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1750 transitions. [2020-10-11 18:26:57,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:26:57,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1750 transitions. [2020-10-11 18:26:57,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:26:57,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:26:57,201 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:26:57,201 INFO L185 Difference]: Start difference. First operand has 212 places, 172 transitions, 1375 flow. Second operand 18 states and 1750 transitions. [2020-10-11 18:26:57,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 189 transitions, 1720 flow [2020-10-11 18:26:58,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 189 transitions, 1178 flow, removed 206 selfloop flow, removed 42 redundant places. [2020-10-11 18:26:58,194 INFO L241 Difference]: Finished difference. Result has 181 places, 163 transitions, 989 flow [2020-10-11 18:26:58,194 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=989, PETRI_PLACES=181, PETRI_TRANSITIONS=163} [2020-10-11 18:26:58,194 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 67 predicate places. [2020-10-11 18:26:58,195 INFO L481 AbstractCegarLoop]: Abstraction has has 181 places, 163 transitions, 989 flow [2020-10-11 18:26:58,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:26:58,195 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:26:58,195 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] [2020-10-11 18:26:58,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-11 18:26:58,195 INFO L429 AbstractCegarLoop]: === Iteration 22 === [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:26:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:26:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1846221288, now seen corresponding path program 1 times [2020-10-11 18:26:58,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:26:58,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811503697] [2020-10-11 18:26:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:26:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:26:58,312 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:26:58,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811503697] [2020-10-11 18:26:58,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:26:58,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:26:58,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698620594] [2020-10-11 18:26:58,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:26:58,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:26:58,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:26:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:26:58,607 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 107 [2020-10-11 18:26:58,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 163 transitions, 989 flow. Second operand 7 states. [2020-10-11 18:26:58,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:26:58,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 107 [2020-10-11 18:26:58,607 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:27:00,272 INFO L129 PetriNetUnfolder]: 3909/9495 cut-off events. [2020-10-11 18:27:00,272 INFO L130 PetriNetUnfolder]: For 27808/31543 co-relation queries the response was YES. [2020-10-11 18:27:00,358 INFO L80 FinitePrefix]: Finished finitePrefix Result has 31850 conditions, 9495 events. 3909/9495 cut-off events. For 27808/31543 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 113137 event pairs, 0 based on Foata normal form. 3/8170 useless extension candidates. Maximal degree in co-relation 31765. Up to 1288 conditions per place. [2020-10-11 18:27:00,365 INFO L132 encePairwiseOnDemand]: 101/107 looper letters, 9 selfloop transitions, 1 changer transitions 21/168 dead transitions. [2020-10-11 18:27:00,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 168 transitions, 1035 flow [2020-10-11 18:27:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:27:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:27:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2020-10-11 18:27:00,366 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9092122830440588 [2020-10-11 18:27:00,366 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2020-10-11 18:27:00,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2020-10-11 18:27:00,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:27:00,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2020-10-11 18:27:00,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:27:00,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:27:00,369 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:27:00,369 INFO L185 Difference]: Start difference. First operand has 181 places, 163 transitions, 989 flow. Second operand 7 states and 681 transitions. [2020-10-11 18:27:00,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 168 transitions, 1035 flow [2020-10-11 18:27:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 168 transitions, 894 flow, removed 14 selfloop flow, removed 21 redundant places. [2020-10-11 18:27:01,508 INFO L241 Difference]: Finished difference. Result has 169 places, 147 transitions, 753 flow [2020-10-11 18:27:01,508 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=753, PETRI_PLACES=169, PETRI_TRANSITIONS=147} [2020-10-11 18:27:01,508 INFO L341 CegarLoopForPetriNet]: 114 programPoint places, 55 predicate places. [2020-10-11 18:27:01,508 INFO L481 AbstractCegarLoop]: Abstraction has has 169 places, 147 transitions, 753 flow [2020-10-11 18:27:01,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:27:01,509 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:27:01,509 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] [2020-10-11 18:27:01,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-11 18:27:01,509 INFO L429 AbstractCegarLoop]: === Iteration 23 === [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:27:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:27:01,509 INFO L82 PathProgramCache]: Analyzing trace with hash -362766698, now seen corresponding path program 2 times [2020-10-11 18:27:01,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:27:01,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914642480] [2020-10-11 18:27:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:27:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:27:01,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:27:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:27:01,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:27:01,624 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:27:01,624 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:27:01,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-11 18:27:01,660 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:27:01,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,662 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:27:01,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,662 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:27:01,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,663 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:27:01,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,663 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:27:01,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,663 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:27:01,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,664 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:27:01,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,664 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:27:01,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,664 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:27:01,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,665 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:27:01,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,665 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:27:01,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,665 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:27:01,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,667 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:27:01,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,667 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:27:01,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,667 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:27:01,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,668 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:27:01,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,668 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:27:01,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,668 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:27:01,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,669 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:27:01,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,669 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:27:01,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,669 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:27:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,670 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:27:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,670 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:27:01,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,670 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:27:01,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,671 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:27:01,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,671 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:27:01,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,671 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:27:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,672 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:27:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,672 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:27:01,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,672 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:27:01,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:27:01,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:27:01 BasicIcfg [2020-10-11 18:27:01,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:27:01,799 INFO L168 Benchmark]: Toolchain (without parser) took 45457.07 ms. Allocated memory was 252.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 206.2 MB in the beginning and 804.6 MB in the end (delta: -598.4 MB). Peak memory consumption was 609.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:01,799 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:27:01,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.26 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 206.2 MB in the beginning and 269.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:01,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 318.8 MB. Free memory was 269.0 MB in the beginning and 266.5 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:27:01,803 INFO L168 Benchmark]: Boogie Preprocessor took 41.22 ms. Allocated memory is still 318.8 MB. Free memory was 266.5 MB in the beginning and 264.0 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:27:01,803 INFO L168 Benchmark]: RCFGBuilder took 1987.26 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 264.0 MB in the beginning and 208.6 MB in the end (delta: 55.3 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:01,804 INFO L168 Benchmark]: TraceAbstraction took 42578.05 ms. Allocated memory was 360.2 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 208.6 MB in the beginning and 804.6 MB in the end (delta: -595.9 MB). Peak memory consumption was 504.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:27:01,812 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 252.7 MB. Free memory is still 226.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 773.26 ms. Allocated memory was 252.7 MB in the beginning and 318.8 MB in the end (delta: 66.1 MB). Free memory was 206.2 MB in the beginning and 269.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.94 ms. Allocated memory is still 318.8 MB. Free memory was 269.0 MB in the beginning and 266.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.22 ms. Allocated memory is still 318.8 MB. Free memory was 266.5 MB in the beginning and 264.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1987.26 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 264.0 MB in the beginning and 208.6 MB in the end (delta: 55.3 MB). Peak memory consumption was 99.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 42578.05 ms. Allocated memory was 360.2 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 208.6 MB in the beginning and 804.6 MB in the end (delta: -595.9 MB). Peak memory consumption was 504.0 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_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L703] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L711] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L712] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L713] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L714] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L715] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L716] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L717] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L718] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L719] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L720] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L721] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L722] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L723] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L724] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L725] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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}] [L726] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L727] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L728] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L729] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L730] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L731] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L823] 0 pthread_t t1525; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=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] [L824] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L825] 0 pthread_t t1526; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L826] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L827] 0 pthread_t t1527; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L828] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L829] 0 pthread_t t1528; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L830] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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] [L750] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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] [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L765] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L768] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L771] 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) [L771] 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) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 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 [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 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 [L801] 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) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] 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) [L801] 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) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 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 [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L836] 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) [L836] 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) [L837] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 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 [L839] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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) [L852] EXPR 0 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_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] 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)) [L852] 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)) [L853] 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)) [L853] EXPR 0 !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) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !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) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, 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, 106 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: 42.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 709 SDtfs, 1153 SDslu, 3745 SDs, 0 SdLazy, 3495 SolverSat, 564 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1501occurred in iteration=19, 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.9s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1570 NumberOfCodeBlocks, 1570 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1469 ConstructedInterpolants, 0 QuantifiedInterpolants, 551837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...