/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/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:44:21,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:44:21,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:44:21,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:44:21,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:44:21,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:44:21,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:44:21,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:44:21,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:44:21,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:44:21,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:44:21,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:44:21,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:44:21,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:44:21,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:44:21,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:44:21,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:44:21,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:44:21,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:44:21,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:44:21,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:44:21,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:44:21,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:44:21,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:44:21,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:44:21,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:44:21,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:44:21,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:44:21,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:44:21,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:44:21,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:44:21,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:44:21,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:44:21,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:44:21,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:44:21,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:44:21,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:44:21,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:44:21,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:44:21,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:44:21,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:44:21,101 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:44:21,123 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:44:21,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:44:21,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:44:21,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:44:21,125 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:44:21,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:44:21,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:44:21,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:44:21,127 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:44:21,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:44:21,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:44:21,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:44:21,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:44:21,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:44:21,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:44:21,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:44:21,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:44:21,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:44:21,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:44:21,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:44:21,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:44:21,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:44:21,129 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:44:21,130 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:44:21,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:44:21,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:44:21,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:44:21,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:44:21,429 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:44:21,429 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:44:21,430 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-11 18:44:21,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640e3b500/2cbb9a2cf37249128ec8d97592c7ce5d/FLAG288ff6eb8 [2020-10-11 18:44:22,048 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:44:22,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-11 18:44:22,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640e3b500/2cbb9a2cf37249128ec8d97592c7ce5d/FLAG288ff6eb8 [2020-10-11 18:44:22,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/640e3b500/2cbb9a2cf37249128ec8d97592c7ce5d [2020-10-11 18:44:22,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:44:22,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:44:22,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:22,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:44:22,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:44:22,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:22" (1/1) ... [2020-10-11 18:44:22,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e25dab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:22, skipping insertion in model container [2020-10-11 18:44:22,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:22" (1/1) ... [2020-10-11 18:44:22,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:44:22,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:44:22,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:22,939 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:44:23,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:23,076 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:44:23,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23 WrapperNode [2020-10-11 18:44:23,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:23,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:23,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:44:23,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:44:23,087 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:44:23" (1/1) ... [2020-10-11 18:44:23,107 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:44:23" (1/1) ... [2020-10-11 18:44:23,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:23,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:44:23,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:44:23,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:44:23,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (1/1) ... [2020-10-11 18:44:23,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:44:23,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:44:23,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:44:23,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:44:23,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (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:44:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:44:23,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:44:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:44:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:44:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:44:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:44:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:44:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:44:23,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:44:23,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:44:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:44:23,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:44:23,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:44:23,266 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:44:25,143 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:44:25,143 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:44:25,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:25 BoogieIcfgContainer [2020-10-11 18:44:25,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:44:25,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:44:25,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:44:25,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:44:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:44:22" (1/3) ... [2020-10-11 18:44:25,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320899c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:25, skipping insertion in model container [2020-10-11 18:44:25,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:23" (2/3) ... [2020-10-11 18:44:25,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320899c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:25, skipping insertion in model container [2020-10-11 18:44:25,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:25" (3/3) ... [2020-10-11 18:44:25,154 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-10-11 18:44:25,167 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:44:25,175 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:44:25,176 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:44:25,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,206 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,208 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,208 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,213 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,227 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,228 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,228 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:25,249 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:44:25,271 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:44:25,271 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:44:25,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:44:25,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:44:25,272 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:44:25,272 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:44:25,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:44:25,272 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:44:25,287 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:44:25,333 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-11 18:44:25,333 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:25,339 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:44:25,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 18:44:25,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-11 18:44:25,362 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:44:25,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:25,363 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:25,364 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] [2020-10-11 18:44:25,364 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1099428094, now seen corresponding path program 1 times [2020-10-11 18:44:25,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:25,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35310327] [2020-10-11 18:44:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:25,731 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:44:25,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35310327] [2020-10-11 18:44:25,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:25,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:44:25,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674856588] [2020-10-11 18:44:25,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:44:25,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:44:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:44:25,857 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 90 [2020-10-11 18:44:25,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states. [2020-10-11 18:44:25,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:25,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 90 [2020-10-11 18:44:25,862 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:25,958 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2020-10-11 18:44:25,958 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:25,959 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:44:25,960 INFO L132 encePairwiseOnDemand]: 85/90 looper letters, 0 selfloop transitions, 2 changer transitions 11/84 dead transitions. [2020-10-11 18:44:25,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 181 flow [2020-10-11 18:44:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:44:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:44:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2020-10-11 18:44:25,978 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2020-10-11 18:44:25,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2020-10-11 18:44:25,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2020-10-11 18:44:25,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:25,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2020-10-11 18:44:25,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:44:25,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:44:25,995 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:44:25,998 INFO L185 Difference]: Start difference. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states and 262 transitions. [2020-10-11 18:44:25,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 181 flow [2020-10-11 18:44:26,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:44:26,007 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 156 flow [2020-10-11 18:44:26,010 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-11 18:44:26,012 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2020-10-11 18:44:26,012 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 156 flow [2020-10-11 18:44:26,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:44:26,012 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:26,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] [2020-10-11 18:44:26,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:44:26,013 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1557231127, now seen corresponding path program 1 times [2020-10-11 18:44:26,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:26,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32287262] [2020-10-11 18:44:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:26,292 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:44:26,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32287262] [2020-10-11 18:44:26,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:26,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:26,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724477114] [2020-10-11 18:44:26,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:26,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:26,478 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:26,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 156 flow. Second operand 6 states. [2020-10-11 18:44:26,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:26,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:26,479 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:26,630 INFO L129 PetriNetUnfolder]: 24/175 cut-off events. [2020-10-11 18:44:26,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:26,632 INFO L80 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 175 events. 24/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 602 event pairs, 5 based on Foata normal form. 4/177 useless extension candidates. Maximal degree in co-relation 211. Up to 31 conditions per place. [2020-10-11 18:44:26,633 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 8 selfloop transitions, 3 changer transitions 19/94 dead transitions. [2020-10-11 18:44:26,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 94 transitions, 258 flow [2020-10-11 18:44:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2020-10-11 18:44:26,640 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.917283950617284 [2020-10-11 18:44:26,640 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2020-10-11 18:44:26,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2020-10-11 18:44:26,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:26,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2020-10-11 18:44:26,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:26,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:26,649 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:26,649 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 156 flow. Second operand 9 states and 743 transitions. [2020-10-11 18:44:26,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 94 transitions, 258 flow [2020-10-11 18:44:26,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 94 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:26,654 INFO L241 Difference]: Finished difference. Result has 95 places, 75 transitions, 195 flow [2020-10-11 18:44:26,654 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=195, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2020-10-11 18:44:26,655 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2020-10-11 18:44:26,655 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 195 flow [2020-10-11 18:44:26,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:26,655 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:26,656 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] [2020-10-11 18:44:26,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:44:26,656 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:26,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1015290602, now seen corresponding path program 1 times [2020-10-11 18:44:26,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:26,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68830047] [2020-10-11 18:44:26,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:26,896 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:44:26,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68830047] [2020-10-11 18:44:26,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:26,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:26,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201754751] [2020-10-11 18:44:26,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:26,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:27,115 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:27,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 195 flow. Second operand 6 states. [2020-10-11 18:44:27,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:27,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:27,118 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:27,309 INFO L129 PetriNetUnfolder]: 56/237 cut-off events. [2020-10-11 18:44:27,309 INFO L130 PetriNetUnfolder]: For 198/202 co-relation queries the response was YES. [2020-10-11 18:44:27,314 INFO L80 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 237 events. 56/237 cut-off events. For 198/202 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 977 event pairs, 26 based on Foata normal form. 6/234 useless extension candidates. Maximal degree in co-relation 472. Up to 61 conditions per place. [2020-10-11 18:44:27,318 INFO L132 encePairwiseOnDemand]: 83/90 looper letters, 8 selfloop transitions, 3 changer transitions 19/96 dead transitions. [2020-10-11 18:44:27,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 315 flow [2020-10-11 18:44:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 743 transitions. [2020-10-11 18:44:27,323 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.917283950617284 [2020-10-11 18:44:27,323 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 743 transitions. [2020-10-11 18:44:27,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 743 transitions. [2020-10-11 18:44:27,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:27,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 743 transitions. [2020-10-11 18:44:27,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:27,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:27,329 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:27,329 INFO L185 Difference]: Start difference. First operand has 95 places, 75 transitions, 195 flow. Second operand 9 states and 743 transitions. [2020-10-11 18:44:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 315 flow [2020-10-11 18:44:27,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 96 transitions, 298 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:27,337 INFO L241 Difference]: Finished difference. Result has 100 places, 77 transitions, 229 flow [2020-10-11 18:44:27,338 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=100, PETRI_TRANSITIONS=77} [2020-10-11 18:44:27,338 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 5 predicate places. [2020-10-11 18:44:27,339 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 77 transitions, 229 flow [2020-10-11 18:44:27,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:27,339 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:27,339 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] [2020-10-11 18:44:27,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:44:27,340 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1513113552, now seen corresponding path program 1 times [2020-10-11 18:44:27,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:27,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954585969] [2020-10-11 18:44:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:27,548 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:44:27,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954585969] [2020-10-11 18:44:27,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:27,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:27,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711689471] [2020-10-11 18:44:27,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:27,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:27,719 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:27,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 77 transitions, 229 flow. Second operand 6 states. [2020-10-11 18:44:27,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:27,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:27,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:27,864 INFO L129 PetriNetUnfolder]: 34/246 cut-off events. [2020-10-11 18:44:27,865 INFO L130 PetriNetUnfolder]: For 414/439 co-relation queries the response was YES. [2020-10-11 18:44:27,867 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 246 events. 34/246 cut-off events. For 414/439 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1174 event pairs, 15 based on Foata normal form. 8/247 useless extension candidates. Maximal degree in co-relation 572. Up to 35 conditions per place. [2020-10-11 18:44:27,868 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 12 selfloop transitions, 3 changer transitions 10/91 dead transitions. [2020-10-11 18:44:27,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 377 flow [2020-10-11 18:44:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2020-10-11 18:44:27,872 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9098765432098765 [2020-10-11 18:44:27,872 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2020-10-11 18:44:27,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2020-10-11 18:44:27,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:27,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2020-10-11 18:44:27,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:27,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:27,876 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:27,876 INFO L185 Difference]: Start difference. First operand has 100 places, 77 transitions, 229 flow. Second operand 9 states and 737 transitions. [2020-10-11 18:44:27,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 91 transitions, 377 flow [2020-10-11 18:44:27,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 91 transitions, 346 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:27,883 INFO L241 Difference]: Finished difference. Result has 105 places, 77 transitions, 241 flow [2020-10-11 18:44:27,883 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=241, PETRI_PLACES=105, PETRI_TRANSITIONS=77} [2020-10-11 18:44:27,883 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 10 predicate places. [2020-10-11 18:44:27,884 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 77 transitions, 241 flow [2020-10-11 18:44:27,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:27,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:27,884 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] [2020-10-11 18:44:27,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:44:27,885 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1553584405, now seen corresponding path program 1 times [2020-10-11 18:44:27,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:27,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306935408] [2020-10-11 18:44:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:28,136 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:44:28,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306935408] [2020-10-11 18:44:28,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:28,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:28,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077637106] [2020-10-11 18:44:28,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:28,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:28,608 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 90 [2020-10-11 18:44:28,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 77 transitions, 241 flow. Second operand 9 states. [2020-10-11 18:44:28,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:28,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 90 [2020-10-11 18:44:28,610 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:29,163 INFO L129 PetriNetUnfolder]: 486/1152 cut-off events. [2020-10-11 18:44:29,163 INFO L130 PetriNetUnfolder]: For 3352/3391 co-relation queries the response was YES. [2020-10-11 18:44:29,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3495 conditions, 1152 events. 486/1152 cut-off events. For 3352/3391 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7411 event pairs, 258 based on Foata normal form. 36/1141 useless extension candidates. Maximal degree in co-relation 3437. Up to 461 conditions per place. [2020-10-11 18:44:29,180 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 12 selfloop transitions, 9 changer transitions 34/118 dead transitions. [2020-10-11 18:44:29,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 493 flow [2020-10-11 18:44:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:44:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:44:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1080 transitions. [2020-10-11 18:44:29,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2020-10-11 18:44:29,184 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1080 transitions. [2020-10-11 18:44:29,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1080 transitions. [2020-10-11 18:44:29,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:29,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1080 transitions. [2020-10-11 18:44:29,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:44:29,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:44:29,190 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:44:29,191 INFO L185 Difference]: Start difference. First operand has 105 places, 77 transitions, 241 flow. Second operand 14 states and 1080 transitions. [2020-10-11 18:44:29,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 493 flow [2020-10-11 18:44:29,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 448 flow, removed 21 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:29,205 INFO L241 Difference]: Finished difference. Result has 116 places, 83 transitions, 308 flow [2020-10-11 18:44:29,205 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=308, PETRI_PLACES=116, PETRI_TRANSITIONS=83} [2020-10-11 18:44:29,206 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 21 predicate places. [2020-10-11 18:44:29,206 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 83 transitions, 308 flow [2020-10-11 18:44:29,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:29,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:29,206 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] [2020-10-11 18:44:29,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:44:29,207 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash -812493197, now seen corresponding path program 1 times [2020-10-11 18:44:29,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:29,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897041506] [2020-10-11 18:44:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:29,401 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:44:29,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897041506] [2020-10-11 18:44:29,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:29,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:29,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481640641] [2020-10-11 18:44:29,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:29,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:30,456 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 90 [2020-10-11 18:44:30,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 83 transitions, 308 flow. Second operand 11 states. [2020-10-11 18:44:30,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:30,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 90 [2020-10-11 18:44:30,458 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:31,000 INFO L129 PetriNetUnfolder]: 400/975 cut-off events. [2020-10-11 18:44:31,001 INFO L130 PetriNetUnfolder]: For 4367/4423 co-relation queries the response was YES. [2020-10-11 18:44:31,014 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 975 events. 400/975 cut-off events. For 4367/4423 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6004 event pairs, 124 based on Foata normal form. 27/961 useless extension candidates. Maximal degree in co-relation 3737. Up to 398 conditions per place. [2020-10-11 18:44:31,023 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 22 selfloop transitions, 9 changer transitions 25/117 dead transitions. [2020-10-11 18:44:31,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 682 flow [2020-10-11 18:44:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:44:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:44:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1190 transitions. [2020-10-11 18:44:31,028 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2020-10-11 18:44:31,028 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1190 transitions. [2020-10-11 18:44:31,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1190 transitions. [2020-10-11 18:44:31,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:31,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1190 transitions. [2020-10-11 18:44:31,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:44:31,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:44:31,036 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:44:31,037 INFO L185 Difference]: Start difference. First operand has 116 places, 83 transitions, 308 flow. Second operand 16 states and 1190 transitions. [2020-10-11 18:44:31,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 682 flow [2020-10-11 18:44:31,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 656 flow, removed 12 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:31,049 INFO L241 Difference]: Finished difference. Result has 128 places, 85 transitions, 361 flow [2020-10-11 18:44:31,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=361, PETRI_PLACES=128, PETRI_TRANSITIONS=85} [2020-10-11 18:44:31,050 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 33 predicate places. [2020-10-11 18:44:31,050 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 85 transitions, 361 flow [2020-10-11 18:44:31,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:31,051 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:31,051 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] [2020-10-11 18:44:31,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:44:31,051 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1544685696, now seen corresponding path program 1 times [2020-10-11 18:44:31,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:31,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225145764] [2020-10-11 18:44:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:31,164 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:44:31,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225145764] [2020-10-11 18:44:31,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:31,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:31,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202846475] [2020-10-11 18:44:31,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:31,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:31,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:31,267 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 90 [2020-10-11 18:44:31,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 85 transitions, 361 flow. Second operand 6 states. [2020-10-11 18:44:31,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:31,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 90 [2020-10-11 18:44:31,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:31,662 INFO L129 PetriNetUnfolder]: 333/1177 cut-off events. [2020-10-11 18:44:31,662 INFO L130 PetriNetUnfolder]: For 9664/9897 co-relation queries the response was YES. [2020-10-11 18:44:31,678 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5179 conditions, 1177 events. 333/1177 cut-off events. For 9664/9897 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9484 event pairs, 125 based on Foata normal form. 36/1173 useless extension candidates. Maximal degree in co-relation 5103. Up to 218 conditions per place. [2020-10-11 18:44:31,741 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 15 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2020-10-11 18:44:31,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 588 flow [2020-10-11 18:44:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 737 transitions. [2020-10-11 18:44:31,747 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9098765432098765 [2020-10-11 18:44:31,747 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 737 transitions. [2020-10-11 18:44:31,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 737 transitions. [2020-10-11 18:44:31,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:31,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 737 transitions. [2020-10-11 18:44:31,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:31,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:31,752 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:31,752 INFO L185 Difference]: Start difference. First operand has 128 places, 85 transitions, 361 flow. Second operand 9 states and 737 transitions. [2020-10-11 18:44:31,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 588 flow [2020-10-11 18:44:31,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 100 transitions, 522 flow, removed 28 selfloop flow, removed 10 redundant places. [2020-10-11 18:44:31,770 INFO L241 Difference]: Finished difference. Result has 124 places, 94 transitions, 487 flow [2020-10-11 18:44:31,770 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=124, PETRI_TRANSITIONS=94} [2020-10-11 18:44:31,770 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 29 predicate places. [2020-10-11 18:44:31,770 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 94 transitions, 487 flow [2020-10-11 18:44:31,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:31,771 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:31,771 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] [2020-10-11 18:44:31,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:44:31,771 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1202563736, now seen corresponding path program 1 times [2020-10-11 18:44:31,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:31,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005605536] [2020-10-11 18:44:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:32,060 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:44:32,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005605536] [2020-10-11 18:44:32,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:32,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:44:32,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532285711] [2020-10-11 18:44:32,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:44:32,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:32,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:44:32,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:44:33,378 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-11 18:44:33,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 94 transitions, 487 flow. Second operand 13 states. [2020-10-11 18:44:33,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:33,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-11 18:44:33,379 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:34,018 INFO L129 PetriNetUnfolder]: 524/1311 cut-off events. [2020-10-11 18:44:34,019 INFO L130 PetriNetUnfolder]: For 10664/10854 co-relation queries the response was YES. [2020-10-11 18:44:34,030 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6385 conditions, 1311 events. 524/1311 cut-off events. For 10664/10854 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8919 event pairs, 221 based on Foata normal form. 17/1283 useless extension candidates. Maximal degree in co-relation 6306. Up to 734 conditions per place. [2020-10-11 18:44:34,040 INFO L132 encePairwiseOnDemand]: 78/90 looper letters, 18 selfloop transitions, 12 changer transitions 23/113 dead transitions. [2020-10-11 18:44:34,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 113 transitions, 778 flow [2020-10-11 18:44:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:44:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:44:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1090 transitions. [2020-10-11 18:44:34,045 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8074074074074075 [2020-10-11 18:44:34,045 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1090 transitions. [2020-10-11 18:44:34,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1090 transitions. [2020-10-11 18:44:34,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:34,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1090 transitions. [2020-10-11 18:44:34,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:44:34,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:44:34,051 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:44:34,051 INFO L185 Difference]: Start difference. First operand has 124 places, 94 transitions, 487 flow. Second operand 15 states and 1090 transitions. [2020-10-11 18:44:34,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 113 transitions, 778 flow [2020-10-11 18:44:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 113 transitions, 723 flow, removed 26 selfloop flow, removed 1 redundant places. [2020-10-11 18:44:34,078 INFO L241 Difference]: Finished difference. Result has 145 places, 88 transitions, 413 flow [2020-10-11 18:44:34,079 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=413, PETRI_PLACES=145, PETRI_TRANSITIONS=88} [2020-10-11 18:44:34,079 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2020-10-11 18:44:34,079 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 88 transitions, 413 flow [2020-10-11 18:44:34,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:44:34,079 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:34,080 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] [2020-10-11 18:44:34,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:44:34,080 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1572048633, now seen corresponding path program 1 times [2020-10-11 18:44:34,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:34,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084733538] [2020-10-11 18:44:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:34,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084733538] [2020-10-11 18:44:34,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:34,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:34,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900673502] [2020-10-11 18:44:34,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:34,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:34,683 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2020-10-11 18:44:34,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 88 transitions, 413 flow. Second operand 9 states. [2020-10-11 18:44:34,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:34,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2020-10-11 18:44:34,684 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:35,124 INFO L129 PetriNetUnfolder]: 421/1241 cut-off events. [2020-10-11 18:44:35,124 INFO L130 PetriNetUnfolder]: For 12698/12839 co-relation queries the response was YES. [2020-10-11 18:44:35,136 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 1241 events. 421/1241 cut-off events. For 12698/12839 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9171 event pairs, 172 based on Foata normal form. 52/1243 useless extension candidates. Maximal degree in co-relation 5703. Up to 376 conditions per place. [2020-10-11 18:44:35,144 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 19 selfloop transitions, 8 changer transitions 23/113 dead transitions. [2020-10-11 18:44:35,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 113 transitions, 751 flow [2020-10-11 18:44:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 856 transitions. [2020-10-11 18:44:35,148 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8646464646464647 [2020-10-11 18:44:35,148 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 856 transitions. [2020-10-11 18:44:35,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 856 transitions. [2020-10-11 18:44:35,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:35,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 856 transitions. [2020-10-11 18:44:35,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:35,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:35,153 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:35,153 INFO L185 Difference]: Start difference. First operand has 145 places, 88 transitions, 413 flow. Second operand 11 states and 856 transitions. [2020-10-11 18:44:35,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 113 transitions, 751 flow [2020-10-11 18:44:35,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 646 flow, removed 44 selfloop flow, removed 21 redundant places. [2020-10-11 18:44:35,177 INFO L241 Difference]: Finished difference. Result has 129 places, 89 transitions, 401 flow [2020-10-11 18:44:35,177 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=401, PETRI_PLACES=129, PETRI_TRANSITIONS=89} [2020-10-11 18:44:35,178 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 34 predicate places. [2020-10-11 18:44:35,178 INFO L481 AbstractCegarLoop]: Abstraction has has 129 places, 89 transitions, 401 flow [2020-10-11 18:44:35,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:35,178 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:35,178 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] [2020-10-11 18:44:35,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:44:35,178 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash -779855151, now seen corresponding path program 1 times [2020-10-11 18:44:35,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:35,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135510731] [2020-10-11 18:44:35,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:35,392 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:44:35,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135510731] [2020-10-11 18:44:35,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:35,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:35,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298701153] [2020-10-11 18:44:35,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:35,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:36,137 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:36,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 89 transitions, 401 flow. Second operand 9 states. [2020-10-11 18:44:36,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:36,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:36,139 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:36,655 INFO L129 PetriNetUnfolder]: 361/1101 cut-off events. [2020-10-11 18:44:36,655 INFO L130 PetriNetUnfolder]: For 9695/9818 co-relation queries the response was YES. [2020-10-11 18:44:36,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1101 events. 361/1101 cut-off events. For 9695/9818 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7982 event pairs, 124 based on Foata normal form. 34/1098 useless extension candidates. Maximal degree in co-relation 5283. Up to 392 conditions per place. [2020-10-11 18:44:36,673 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 27 selfloop transitions, 14 changer transitions 19/121 dead transitions. [2020-10-11 18:44:36,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 121 transitions, 916 flow [2020-10-11 18:44:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 841 transitions. [2020-10-11 18:44:36,677 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8494949494949495 [2020-10-11 18:44:36,677 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 841 transitions. [2020-10-11 18:44:36,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 841 transitions. [2020-10-11 18:44:36,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:36,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 841 transitions. [2020-10-11 18:44:36,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:36,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:36,682 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:36,682 INFO L185 Difference]: Start difference. First operand has 129 places, 89 transitions, 401 flow. Second operand 11 states and 841 transitions. [2020-10-11 18:44:36,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 121 transitions, 916 flow [2020-10-11 18:44:36,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 121 transitions, 871 flow, removed 16 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:36,703 INFO L241 Difference]: Finished difference. Result has 134 places, 97 transitions, 535 flow [2020-10-11 18:44:36,703 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=535, PETRI_PLACES=134, PETRI_TRANSITIONS=97} [2020-10-11 18:44:36,703 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 39 predicate places. [2020-10-11 18:44:36,704 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 97 transitions, 535 flow [2020-10-11 18:44:36,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:36,704 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:36,704 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] [2020-10-11 18:44:36,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:44:36,705 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:36,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:36,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1680434547, now seen corresponding path program 2 times [2020-10-11 18:44:36,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:36,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768071731] [2020-10-11 18:44:36,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:36,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768071731] [2020-10-11 18:44:36,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:36,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:44:36,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579260353] [2020-10-11 18:44:36,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:44:36,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:44:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:44:37,698 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 90 [2020-10-11 18:44:37,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 97 transitions, 535 flow. Second operand 10 states. [2020-10-11 18:44:37,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:37,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 90 [2020-10-11 18:44:37,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:38,175 INFO L129 PetriNetUnfolder]: 289/1007 cut-off events. [2020-10-11 18:44:38,175 INFO L130 PetriNetUnfolder]: For 10737/10996 co-relation queries the response was YES. [2020-10-11 18:44:38,184 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5159 conditions, 1007 events. 289/1007 cut-off events. For 10737/10996 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7602 event pairs, 93 based on Foata normal form. 43/1016 useless extension candidates. Maximal degree in co-relation 5077. Up to 246 conditions per place. [2020-10-11 18:44:38,192 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 26 selfloop transitions, 14 changer transitions 20/123 dead transitions. [2020-10-11 18:44:38,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 123 transitions, 1029 flow [2020-10-11 18:44:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2020-10-11 18:44:38,196 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8656565656565657 [2020-10-11 18:44:38,196 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 857 transitions. [2020-10-11 18:44:38,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 857 transitions. [2020-10-11 18:44:38,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:38,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 857 transitions. [2020-10-11 18:44:38,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:38,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:38,205 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:38,205 INFO L185 Difference]: Start difference. First operand has 134 places, 97 transitions, 535 flow. Second operand 11 states and 857 transitions. [2020-10-11 18:44:38,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 123 transitions, 1029 flow [2020-10-11 18:44:38,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 123 transitions, 880 flow, removed 74 selfloop flow, removed 10 redundant places. [2020-10-11 18:44:38,238 INFO L241 Difference]: Finished difference. Result has 135 places, 98 transitions, 549 flow [2020-10-11 18:44:38,238 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=135, PETRI_TRANSITIONS=98} [2020-10-11 18:44:38,239 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 40 predicate places. [2020-10-11 18:44:38,239 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 98 transitions, 549 flow [2020-10-11 18:44:38,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:44:38,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:38,239 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:44:38,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:44:38,240 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1214417970, now seen corresponding path program 1 times [2020-10-11 18:44:38,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:38,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977562257] [2020-10-11 18:44:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:38,559 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:44:38,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977562257] [2020-10-11 18:44:38,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:38,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:38,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114699449] [2020-10-11 18:44:38,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:38,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:38,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:39,664 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:39,665 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 98 transitions, 549 flow. Second operand 11 states. [2020-10-11 18:44:39,665 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:39,665 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:39,665 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:40,451 INFO L129 PetriNetUnfolder]: 197/835 cut-off events. [2020-10-11 18:44:40,452 INFO L130 PetriNetUnfolder]: For 9093/9355 co-relation queries the response was YES. [2020-10-11 18:44:40,459 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 835 events. 197/835 cut-off events. For 9093/9355 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6151 event pairs, 71 based on Foata normal form. 27/835 useless extension candidates. Maximal degree in co-relation 4150. Up to 237 conditions per place. [2020-10-11 18:44:40,464 INFO L132 encePairwiseOnDemand]: 79/90 looper letters, 28 selfloop transitions, 18 changer transitions 10/117 dead transitions. [2020-10-11 18:44:40,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 117 transitions, 943 flow [2020-10-11 18:44:40,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 976 transitions. [2020-10-11 18:44:40,470 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8341880341880342 [2020-10-11 18:44:40,470 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 976 transitions. [2020-10-11 18:44:40,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 976 transitions. [2020-10-11 18:44:40,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:40,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 976 transitions. [2020-10-11 18:44:40,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:40,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:40,477 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:40,477 INFO L185 Difference]: Start difference. First operand has 135 places, 98 transitions, 549 flow. Second operand 13 states and 976 transitions. [2020-10-11 18:44:40,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 117 transitions, 943 flow [2020-10-11 18:44:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 117 transitions, 888 flow, removed 18 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:40,502 INFO L241 Difference]: Finished difference. Result has 142 places, 102 transitions, 663 flow [2020-10-11 18:44:40,503 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=663, PETRI_PLACES=142, PETRI_TRANSITIONS=102} [2020-10-11 18:44:40,503 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 47 predicate places. [2020-10-11 18:44:40,503 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 102 transitions, 663 flow [2020-10-11 18:44:40,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:40,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:40,504 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 18:44:40,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:44:40,504 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1856987786, now seen corresponding path program 2 times [2020-10-11 18:44:40,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:40,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844964924] [2020-10-11 18:44:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:40,810 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:44:40,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844964924] [2020-10-11 18:44:40,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:40,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:44:40,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146602195] [2020-10-11 18:44:40,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:44:40,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:44:40,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:44:42,191 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 90 [2020-10-11 18:44:42,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 102 transitions, 663 flow. Second operand 13 states. [2020-10-11 18:44:42,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:42,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 90 [2020-10-11 18:44:42,193 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:42,575 INFO L129 PetriNetUnfolder]: 151/741 cut-off events. [2020-10-11 18:44:42,575 INFO L130 PetriNetUnfolder]: For 8452/8821 co-relation queries the response was YES. [2020-10-11 18:44:42,581 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 741 events. 151/741 cut-off events. For 8452/8821 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5535 event pairs, 40 based on Foata normal form. 30/747 useless extension candidates. Maximal degree in co-relation 3647. Up to 144 conditions per place. [2020-10-11 18:44:42,586 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 31 selfloop transitions, 14 changer transitions 11/117 dead transitions. [2020-10-11 18:44:42,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 117 transitions, 1001 flow [2020-10-11 18:44:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2020-10-11 18:44:42,589 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2020-10-11 18:44:42,589 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2020-10-11 18:44:42,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2020-10-11 18:44:42,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:42,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2020-10-11 18:44:42,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:42,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:42,594 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:42,594 INFO L185 Difference]: Start difference. First operand has 142 places, 102 transitions, 663 flow. Second operand 13 states and 972 transitions. [2020-10-11 18:44:42,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 117 transitions, 1001 flow [2020-10-11 18:44:42,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 117 transitions, 896 flow, removed 50 selfloop flow, removed 9 redundant places. [2020-10-11 18:44:42,623 INFO L241 Difference]: Finished difference. Result has 146 places, 101 transitions, 635 flow [2020-10-11 18:44:42,624 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=635, PETRI_PLACES=146, PETRI_TRANSITIONS=101} [2020-10-11 18:44:42,624 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 51 predicate places. [2020-10-11 18:44:42,625 INFO L481 AbstractCegarLoop]: Abstraction has has 146 places, 101 transitions, 635 flow [2020-10-11 18:44:42,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:44:42,625 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:42,625 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:44:42,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:44:42,626 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:42,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1948509896, now seen corresponding path program 1 times [2020-10-11 18:44:42,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:42,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134998268] [2020-10-11 18:44:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:42,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134998268] [2020-10-11 18:44:42,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:42,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:42,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051753555] [2020-10-11 18:44:42,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:42,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:42,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:42,888 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:44:42,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 101 transitions, 635 flow. Second operand 6 states. [2020-10-11 18:44:42,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:42,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:44:42,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:43,409 INFO L129 PetriNetUnfolder]: 1057/2683 cut-off events. [2020-10-11 18:44:43,410 INFO L130 PetriNetUnfolder]: For 8335/8505 co-relation queries the response was YES. [2020-10-11 18:44:43,428 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7469 conditions, 2683 events. 1057/2683 cut-off events. For 8335/8505 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 24772 event pairs, 228 based on Foata normal form. 70/2479 useless extension candidates. Maximal degree in co-relation 7381. Up to 823 conditions per place. [2020-10-11 18:44:43,438 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 19 selfloop transitions, 16 changer transitions 3/126 dead transitions. [2020-10-11 18:44:43,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 126 transitions, 755 flow [2020-10-11 18:44:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2020-10-11 18:44:43,448 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9012345679012346 [2020-10-11 18:44:43,448 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2020-10-11 18:44:43,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2020-10-11 18:44:43,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:43,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2020-10-11 18:44:43,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:43,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:43,452 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:43,452 INFO L185 Difference]: Start difference. First operand has 146 places, 101 transitions, 635 flow. Second operand 9 states and 730 transitions. [2020-10-11 18:44:43,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 126 transitions, 755 flow [2020-10-11 18:44:43,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 126 transitions, 673 flow, removed 28 selfloop flow, removed 17 redundant places. [2020-10-11 18:44:43,488 INFO L241 Difference]: Finished difference. Result has 136 places, 112 transitions, 639 flow [2020-10-11 18:44:43,488 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=639, PETRI_PLACES=136, PETRI_TRANSITIONS=112} [2020-10-11 18:44:43,488 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 41 predicate places. [2020-10-11 18:44:43,488 INFO L481 AbstractCegarLoop]: Abstraction has has 136 places, 112 transitions, 639 flow [2020-10-11 18:44:43,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:43,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:43,489 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] [2020-10-11 18:44:43,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:44:43,489 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:43,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1112492278, now seen corresponding path program 1 times [2020-10-11 18:44:43,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:43,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141962966] [2020-10-11 18:44:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:43,594 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:44:43,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141962966] [2020-10-11 18:44:43,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:43,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:44:43,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959739230] [2020-10-11 18:44:43,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:44:43,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:43,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:44:43,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:44:43,721 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:44:43,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 112 transitions, 639 flow. Second operand 7 states. [2020-10-11 18:44:43,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:43,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:44:43,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:44,195 INFO L129 PetriNetUnfolder]: 894/2447 cut-off events. [2020-10-11 18:44:44,196 INFO L130 PetriNetUnfolder]: For 6794/9300 co-relation queries the response was YES. [2020-10-11 18:44:44,208 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8623 conditions, 2447 events. 894/2447 cut-off events. For 6794/9300 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 23746 event pairs, 16 based on Foata normal form. 387/2607 useless extension candidates. Maximal degree in co-relation 8544. Up to 969 conditions per place. [2020-10-11 18:44:44,214 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 15 selfloop transitions, 31 changer transitions 10/136 dead transitions. [2020-10-11 18:44:44,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 136 transitions, 887 flow [2020-10-11 18:44:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:44:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:44:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 974 transitions. [2020-10-11 18:44:44,217 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9018518518518519 [2020-10-11 18:44:44,217 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 974 transitions. [2020-10-11 18:44:44,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 974 transitions. [2020-10-11 18:44:44,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:44,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 974 transitions. [2020-10-11 18:44:44,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:44:44,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:44:44,221 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:44:44,221 INFO L185 Difference]: Start difference. First operand has 136 places, 112 transitions, 639 flow. Second operand 12 states and 974 transitions. [2020-10-11 18:44:44,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 136 transitions, 887 flow [2020-10-11 18:44:44,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 136 transitions, 869 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-11 18:44:44,238 INFO L241 Difference]: Finished difference. Result has 147 places, 123 transitions, 778 flow [2020-10-11 18:44:44,238 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=778, PETRI_PLACES=147, PETRI_TRANSITIONS=123} [2020-10-11 18:44:44,239 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 52 predicate places. [2020-10-11 18:44:44,239 INFO L481 AbstractCegarLoop]: Abstraction has has 147 places, 123 transitions, 778 flow [2020-10-11 18:44:44,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:44:44,239 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:44,239 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:44:44,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:44:44,240 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -889351681, now seen corresponding path program 1 times [2020-10-11 18:44:44,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:44,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159292322] [2020-10-11 18:44:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:44,363 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:44:44,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159292322] [2020-10-11 18:44:44,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:44,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:44:44,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766522056] [2020-10-11 18:44:44,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:44:44,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:44:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:44:44,566 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-11 18:44:44,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 123 transitions, 778 flow. Second operand 8 states. [2020-10-11 18:44:44,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:44,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-11 18:44:44,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:45,208 INFO L129 PetriNetUnfolder]: 688/2164 cut-off events. [2020-10-11 18:44:45,208 INFO L130 PetriNetUnfolder]: For 9246/15827 co-relation queries the response was YES. [2020-10-11 18:44:45,216 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 2164 events. 688/2164 cut-off events. For 9246/15827 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 22220 event pairs, 0 based on Foata normal form. 497/2438 useless extension candidates. Maximal degree in co-relation 8444. Up to 778 conditions per place. [2020-10-11 18:44:45,219 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 32 changer transitions 32/141 dead transitions. [2020-10-11 18:44:45,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 141 transitions, 1020 flow [2020-10-11 18:44:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:44:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:44:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1206 transitions. [2020-10-11 18:44:45,222 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8933333333333333 [2020-10-11 18:44:45,222 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1206 transitions. [2020-10-11 18:44:45,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1206 transitions. [2020-10-11 18:44:45,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:45,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1206 transitions. [2020-10-11 18:44:45,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:44:45,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:44:45,226 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:44:45,226 INFO L185 Difference]: Start difference. First operand has 147 places, 123 transitions, 778 flow. Second operand 15 states and 1206 transitions. [2020-10-11 18:44:45,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 141 transitions, 1020 flow [2020-10-11 18:44:45,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 141 transitions, 773 flow, removed 91 selfloop flow, removed 21 redundant places. [2020-10-11 18:44:45,305 INFO L241 Difference]: Finished difference. Result has 145 places, 106 transitions, 545 flow [2020-10-11 18:44:45,305 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=545, PETRI_PLACES=145, PETRI_TRANSITIONS=106} [2020-10-11 18:44:45,306 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 50 predicate places. [2020-10-11 18:44:45,306 INFO L481 AbstractCegarLoop]: Abstraction has has 145 places, 106 transitions, 545 flow [2020-10-11 18:44:45,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:44:45,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:45,306 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:44:45,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:44:45,306 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 358773836, now seen corresponding path program 1 times [2020-10-11 18:44:45,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:45,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550932423] [2020-10-11 18:44:45,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:45,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:45,370 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:45,408 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:44:45,409 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:44:45,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:44:45,434 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:44:45,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,435 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:44:45,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,435 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:44:45,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,435 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:44:45,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,436 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:44:45,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,436 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:44:45,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,436 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:44:45,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,437 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:44:45,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,437 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:44:45,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,437 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:44:45,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,438 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:44:45,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,439 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:44:45,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,439 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:44:45,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,439 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:44:45,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,440 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:44:45,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,440 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:44:45,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,440 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:44:45,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,441 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:44:45,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,441 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:44:45,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,442 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:44:45,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,442 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:44:45,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,442 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:44:45,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,443 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:44:45,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,443 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:44:45,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,443 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:44:45,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,444 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:44:45,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,444 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:44:45,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,444 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:44:45,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,445 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:44:45,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,445 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:44:45,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,445 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:44:45,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:45,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:44:45 BasicIcfg [2020-10-11 18:44:45,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:44:45,555 INFO L168 Benchmark]: Toolchain (without parser) took 23217.44 ms. Allocated memory was 249.6 MB in the beginning and 793.2 MB in the end (delta: 543.7 MB). Free memory was 204.9 MB in the beginning and 609.6 MB in the end (delta: -404.7 MB). Peak memory consumption was 139.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:45,555 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:44:45,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.66 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 259.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:45,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 308.8 MB. Free memory was 259.6 MB in the beginning and 254.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:45,558 INFO L168 Benchmark]: Boogie Preprocessor took 45.42 ms. Allocated memory is still 308.8 MB. Free memory is still 254.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:44:45,560 INFO L168 Benchmark]: RCFGBuilder took 1952.65 ms. Allocated memory was 308.8 MB in the beginning and 356.5 MB in the end (delta: 47.7 MB). Free memory was 254.6 MB in the beginning and 207.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:45,561 INFO L168 Benchmark]: TraceAbstraction took 20405.06 ms. Allocated memory was 356.5 MB in the beginning and 793.2 MB in the end (delta: 436.7 MB). Free memory was 207.7 MB in the beginning and 609.6 MB in the end (delta: -402.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:45,567 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.24 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 740.66 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 204.9 MB in the beginning and 259.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 308.8 MB. Free memory was 259.6 MB in the beginning and 254.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.42 ms. Allocated memory is still 308.8 MB. Free memory is still 254.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1952.65 ms. Allocated memory was 308.8 MB in the beginning and 356.5 MB in the end (delta: 47.7 MB). Free memory was 254.6 MB in the beginning and 207.7 MB in the end (delta: 46.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 20405.06 ms. Allocated memory was 356.5 MB in the beginning and 793.2 MB in the end (delta: 436.7 MB). Free memory was 207.7 MB in the beginning and 609.6 MB in the end (delta: -402.0 MB). Peak memory consumption was 34.8 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: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L711] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L712] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L713] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L714] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 0 pthread_t t2492; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2493; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2494; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 20.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 16.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 421 SDtfs, 771 SDslu, 2074 SDs, 0 SdLazy, 2052 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 993 NumberOfCodeBlocks, 993 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 910 ConstructedInterpolants, 0 QuantifiedInterpolants, 293174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...