/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:47:19,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:47:19,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:47:19,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:47:19,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:47:19,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:47:19,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:47:19,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:47:19,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:47:19,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:47:19,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:47:19,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:47:19,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:47:19,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:47:19,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:47:19,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:47:19,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:47:19,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:47:19,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:47:19,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:47:19,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:47:19,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:47:19,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:47:19,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:47:19,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:47:19,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:47:19,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:47:19,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:47:19,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:47:19,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:47:19,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:47:19,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:47:19,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:47:19,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:47:19,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:47:19,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:47:19,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:47:19,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:47:19,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:47:19,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:47:19,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:47:19,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:47:19,123 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:47:19,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:47:19,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:47:19,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:47:19,125 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:47:19,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:47:19,125 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:47:19,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:47:19,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:47:19,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:47:19,127 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:47:19,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:47:19,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:47:19,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:47:19,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:47:19,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:47:19,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:47:19,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:47:19,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:47:19,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:47:19,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:47:19,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:47:19,129 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:47:19,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:47:19,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:47:19,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:47:19,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:47:19,430 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:47:19,431 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:47:19,431 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-16 04:47:19,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a2d4b5d/6691da95a3fe47bf8b0c0e94efefefe8/FLAGbc913eb69 [2020-10-16 04:47:20,025 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:47:20,027 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-16 04:47:20,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a2d4b5d/6691da95a3fe47bf8b0c0e94efefefe8/FLAGbc913eb69 [2020-10-16 04:47:20,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a2d4b5d/6691da95a3fe47bf8b0c0e94efefefe8 [2020-10-16 04:47:20,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:47:20,325 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:47:20,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:20,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:47:20,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:47:20,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:20" (1/1) ... [2020-10-16 04:47:20,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2359dd1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:20, skipping insertion in model container [2020-10-16 04:47:20,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:47:20" (1/1) ... [2020-10-16 04:47:20,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:47:20,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:47:20,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:20,949 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:47:21,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:47:21,083 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:47:21,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21 WrapperNode [2020-10-16 04:47:21,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:47:21,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:21,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:47:21,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:47:21,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:47:21,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:47:21,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:47:21,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:47:21,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... [2020-10-16 04:47:21,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:47:21,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:47:21,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:47:21,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:47:21,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:47:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:47:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:47:21,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:47:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:47:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:47:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:47:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:47:21,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:47:21,253 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:47:21,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:47:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:47:21,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:47:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:47:21,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:47:21,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:47:21,256 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:47:23,153 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:47:23,153 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:47:23,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:23 BoogieIcfgContainer [2020-10-16 04:47:23,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:47:23,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:47:23,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:47:23,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:47:23,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:47:20" (1/3) ... [2020-10-16 04:47:23,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fba4b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:23, skipping insertion in model container [2020-10-16 04:47:23,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:47:21" (2/3) ... [2020-10-16 04:47:23,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fba4b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:47:23, skipping insertion in model container [2020-10-16 04:47:23,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:47:23" (3/3) ... [2020-10-16 04:47:23,164 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2020-10-16 04:47:23,175 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:47:23,183 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:47:23,184 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:47:23,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,216 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,217 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,218 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,218 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,221 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,222 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,225 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,226 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,226 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,226 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,226 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,227 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,228 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,233 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,234 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,234 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,234 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,239 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,244 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:47:23,261 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:47:23,282 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:47:23,282 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:47:23,282 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:47:23,282 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:47:23,283 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:47:23,283 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:47:23,283 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:47:23,283 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:47:23,298 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 04:47:23,408 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 04:47:23,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:23,413 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:47:23,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 110 transitions, 240 flow [2020-10-16 04:47:23,421 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 106 transitions, 224 flow [2020-10-16 04:47:23,424 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:47:23,427 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 04:47:23,430 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 106 transitions, 224 flow [2020-10-16 04:47:23,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 106 transitions, 224 flow [2020-10-16 04:47:23,458 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-16 04:47:23,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:23,460 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:47:23,463 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-16 04:47:23,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:47:23,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:23,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:23,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:23,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:23,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:23,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:47:23,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:23,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:23,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:24,917 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 04:47:24,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-16 04:47:24,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:24,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:47:24,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:25,800 WARN L193 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-16 04:47:25,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:25,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:25,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:25,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:25,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:25,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:25,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:25,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:25,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:25,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:25,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:25,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:25,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:25,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:25,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:25,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,408 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:47:26,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:26,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:26,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:26,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:26,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:47:27,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:27,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:27,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:27,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:27,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:27,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:47:28,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:47:28,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:47:28,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:28,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:47:28,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:47:29,341 WARN L193 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-16 04:47:29,628 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 04:47:30,470 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 04:47:30,645 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 04:47:31,578 WARN L193 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-16 04:47:31,911 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 04:47:32,013 INFO L132 LiptonReduction]: Checked pairs total: 6617 [2020-10-16 04:47:32,013 INFO L134 LiptonReduction]: Total number of compositions: 86 [2020-10-16 04:47:32,017 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8596 [2020-10-16 04:47:32,027 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2020-10-16 04:47:32,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:32,028 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:32,029 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:32,029 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1489343455, now seen corresponding path program 1 times [2020-10-16 04:47:32,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:32,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437002728] [2020-10-16 04:47:32,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:32,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437002728] [2020-10-16 04:47:32,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:32,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:32,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631539069] [2020-10-16 04:47:32,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:32,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:32,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:32,284 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 196 [2020-10-16 04:47:32,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:47:32,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:32,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 196 [2020-10-16 04:47:32,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:32,395 INFO L129 PetriNetUnfolder]: 69/146 cut-off events. [2020-10-16 04:47:32,395 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:47:32,396 INFO L80 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 146 events. 69/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 616 event pairs, 39 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 266. Up to 89 conditions per place. [2020-10-16 04:47:32,399 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 9 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2020-10-16 04:47:32,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow [2020-10-16 04:47:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2020-10-16 04:47:32,417 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8758503401360545 [2020-10-16 04:47:32,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2020-10-16 04:47:32,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2020-10-16 04:47:32,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:32,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2020-10-16 04:47:32,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:32,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:32,435 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:32,437 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 515 transitions. [2020-10-16 04:47:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow [2020-10-16 04:47:32,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:47:32,443 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2020-10-16 04:47:32,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 04:47:32,447 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:47:32,447 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2020-10-16 04:47:32,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:32,447 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:32,447 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:32,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:47:32,448 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1773826398, now seen corresponding path program 1 times [2020-10-16 04:47:32,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:32,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756650716] [2020-10-16 04:47:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:32,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756650716] [2020-10-16 04:47:32,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:32,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:32,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856739257] [2020-10-16 04:47:32,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:32,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:32,560 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 196 [2020-10-16 04:47:32,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states. [2020-10-16 04:47:32,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:32,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 196 [2020-10-16 04:47:32,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:32,648 INFO L129 PetriNetUnfolder]: 156/305 cut-off events. [2020-10-16 04:47:32,648 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 04:47:32,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 305 events. 156/305 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1452 event pairs, 89 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 580. Up to 246 conditions per place. [2020-10-16 04:47:32,652 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2020-10-16 04:47:32,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 104 flow [2020-10-16 04:47:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2020-10-16 04:47:32,655 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8316326530612245 [2020-10-16 04:47:32,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2020-10-16 04:47:32,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2020-10-16 04:47:32,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:32,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2020-10-16 04:47:32,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:32,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:32,659 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:32,659 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 489 transitions. [2020-10-16 04:47:32,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 104 flow [2020-10-16 04:47:32,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:32,661 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2020-10-16 04:47:32,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2020-10-16 04:47:32,662 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:47:32,662 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2020-10-16 04:47:32,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:32,662 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:32,662 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:32,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:47:32,663 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 845903579, now seen corresponding path program 1 times [2020-10-16 04:47:32,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:32,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810329387] [2020-10-16 04:47:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:32,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810329387] [2020-10-16 04:47:32,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:32,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:32,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920232429] [2020-10-16 04:47:32,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:32,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:32,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:32,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:32,744 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 196 [2020-10-16 04:47:32,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states. [2020-10-16 04:47:32,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:32,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 196 [2020-10-16 04:47:32,744 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:32,766 INFO L129 PetriNetUnfolder]: 10/62 cut-off events. [2020-10-16 04:47:32,766 INFO L130 PetriNetUnfolder]: For 10/18 co-relation queries the response was YES. [2020-10-16 04:47:32,766 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 62 events. 10/62 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 182 event pairs, 4 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 104. Up to 23 conditions per place. [2020-10-16 04:47:32,767 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 4 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2020-10-16 04:47:32,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 103 flow [2020-10-16 04:47:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2020-10-16 04:47:32,770 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8962585034013606 [2020-10-16 04:47:32,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2020-10-16 04:47:32,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2020-10-16 04:47:32,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:32,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2020-10-16 04:47:32,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:32,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:32,773 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:32,773 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states and 527 transitions. [2020-10-16 04:47:32,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 103 flow [2020-10-16 04:47:32,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:32,775 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 102 flow [2020-10-16 04:47:32,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2020-10-16 04:47:32,776 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2020-10-16 04:47:32,776 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 102 flow [2020-10-16 04:47:32,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:32,776 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:32,808 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:32,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:47:32,809 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash 845152077, now seen corresponding path program 1 times [2020-10-16 04:47:32,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:32,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88770787] [2020-10-16 04:47:32,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:32,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88770787] [2020-10-16 04:47:32,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:32,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:32,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234789860] [2020-10-16 04:47:32,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:32,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:32,877 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 196 [2020-10-16 04:47:32,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 102 flow. Second operand 3 states. [2020-10-16 04:47:32,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:32,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 196 [2020-10-16 04:47:32,878 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:32,950 INFO L129 PetriNetUnfolder]: 118/249 cut-off events. [2020-10-16 04:47:32,951 INFO L130 PetriNetUnfolder]: For 85/101 co-relation queries the response was YES. [2020-10-16 04:47:32,952 INFO L80 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 249 events. 118/249 cut-off events. For 85/101 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1137 event pairs, 49 based on Foata normal form. 2/236 useless extension candidates. Maximal degree in co-relation 551. Up to 176 conditions per place. [2020-10-16 04:47:32,954 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 9 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2020-10-16 04:47:32,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 138 flow [2020-10-16 04:47:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2020-10-16 04:47:32,957 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2020-10-16 04:47:32,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2020-10-16 04:47:32,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2020-10-16 04:47:32,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:32,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2020-10-16 04:47:32,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:32,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:32,961 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:32,961 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 102 flow. Second operand 3 states and 496 transitions. [2020-10-16 04:47:32,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 138 flow [2020-10-16 04:47:32,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:32,963 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 122 flow [2020-10-16 04:47:32,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2020-10-16 04:47:32,963 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2020-10-16 04:47:32,964 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 122 flow [2020-10-16 04:47:32,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:32,964 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:32,964 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:32,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:47:32,964 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash 454818880, now seen corresponding path program 1 times [2020-10-16 04:47:32,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:32,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163193645] [2020-10-16 04:47:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:33,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163193645] [2020-10-16 04:47:33,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:33,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:33,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889338141] [2020-10-16 04:47:33,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:33,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:33,008 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 196 [2020-10-16 04:47:33,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 122 flow. Second operand 3 states. [2020-10-16 04:47:33,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:33,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 196 [2020-10-16 04:47:33,009 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:33,021 INFO L129 PetriNetUnfolder]: 5/44 cut-off events. [2020-10-16 04:47:33,022 INFO L130 PetriNetUnfolder]: For 42/53 co-relation queries the response was YES. [2020-10-16 04:47:33,022 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 44 events. 5/44 cut-off events. For 42/53 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 86. Up to 11 conditions per place. [2020-10-16 04:47:33,022 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 1 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2020-10-16 04:47:33,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 130 flow [2020-10-16 04:47:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:33,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2020-10-16 04:47:33,025 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9098639455782312 [2020-10-16 04:47:33,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2020-10-16 04:47:33,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2020-10-16 04:47:33,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:33,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2020-10-16 04:47:33,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:33,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:33,028 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:33,029 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 122 flow. Second operand 3 states and 535 transitions. [2020-10-16 04:47:33,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 130 flow [2020-10-16 04:47:33,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:33,031 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 129 flow [2020-10-16 04:47:33,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2020-10-16 04:47:33,031 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2020-10-16 04:47:33,031 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 129 flow [2020-10-16 04:47:33,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:33,032 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:33,032 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:33,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:47:33,032 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 428212448, now seen corresponding path program 1 times [2020-10-16 04:47:33,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:33,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857363659] [2020-10-16 04:47:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:33,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857363659] [2020-10-16 04:47:33,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:33,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:33,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200302054] [2020-10-16 04:47:33,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:33,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:33,084 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2020-10-16 04:47:33,084 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 129 flow. Second operand 3 states. [2020-10-16 04:47:33,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:33,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2020-10-16 04:47:33,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:33,217 INFO L129 PetriNetUnfolder]: 359/662 cut-off events. [2020-10-16 04:47:33,218 INFO L130 PetriNetUnfolder]: For 757/829 co-relation queries the response was YES. [2020-10-16 04:47:33,220 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 662 events. 359/662 cut-off events. For 757/829 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3682 event pairs, 179 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 1608. Up to 499 conditions per place. [2020-10-16 04:47:33,225 INFO L132 encePairwiseOnDemand]: 191/196 looper letters, 12 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2020-10-16 04:47:33,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 191 flow [2020-10-16 04:47:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2020-10-16 04:47:33,228 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8163265306122449 [2020-10-16 04:47:33,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2020-10-16 04:47:33,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2020-10-16 04:47:33,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:33,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2020-10-16 04:47:33,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:33,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:33,231 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:33,231 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 129 flow. Second operand 3 states and 480 transitions. [2020-10-16 04:47:33,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 191 flow [2020-10-16 04:47:33,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:33,234 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 175 flow [2020-10-16 04:47:33,234 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2020-10-16 04:47:33,234 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 04:47:33,235 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 175 flow [2020-10-16 04:47:33,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:33,235 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:33,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:33,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:47:33,235 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1214451789, now seen corresponding path program 1 times [2020-10-16 04:47:33,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:33,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784541768] [2020-10-16 04:47:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:33,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784541768] [2020-10-16 04:47:33,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:33,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:33,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925498807] [2020-10-16 04:47:33,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:47:33,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:33,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:47:33,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:47:33,307 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 196 [2020-10-16 04:47:33,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 175 flow. Second operand 5 states. [2020-10-16 04:47:33,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:33,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 196 [2020-10-16 04:47:33,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:33,519 INFO L129 PetriNetUnfolder]: 470/854 cut-off events. [2020-10-16 04:47:33,519 INFO L130 PetriNetUnfolder]: For 1376/1455 co-relation queries the response was YES. [2020-10-16 04:47:33,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 854 events. 470/854 cut-off events. For 1376/1455 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4924 event pairs, 234 based on Foata normal form. 13/796 useless extension candidates. Maximal degree in co-relation 2376. Up to 636 conditions per place. [2020-10-16 04:47:33,530 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 13 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2020-10-16 04:47:33,531 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 241 flow [2020-10-16 04:47:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 625 transitions. [2020-10-16 04:47:33,534 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7971938775510204 [2020-10-16 04:47:33,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 625 transitions. [2020-10-16 04:47:33,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 625 transitions. [2020-10-16 04:47:33,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:33,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 625 transitions. [2020-10-16 04:47:33,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:33,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:33,539 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:33,540 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 175 flow. Second operand 4 states and 625 transitions. [2020-10-16 04:47:33,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 241 flow [2020-10-16 04:47:33,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:33,545 INFO L241 Difference]: Finished difference. Result has 49 places, 43 transitions, 225 flow [2020-10-16 04:47:33,546 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2020-10-16 04:47:33,546 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2020-10-16 04:47:33,547 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 225 flow [2020-10-16 04:47:33,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:47:33,547 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:33,547 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:33,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:47:33,549 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 441012050, now seen corresponding path program 1 times [2020-10-16 04:47:33,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:33,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9940326] [2020-10-16 04:47:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:33,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9940326] [2020-10-16 04:47:33,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:33,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:47:33,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396568055] [2020-10-16 04:47:33,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:33,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:33,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:33,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:33,651 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 196 [2020-10-16 04:47:33,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 225 flow. Second operand 3 states. [2020-10-16 04:47:33,652 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:33,652 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 196 [2020-10-16 04:47:33,652 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:33,833 INFO L129 PetriNetUnfolder]: 434/803 cut-off events. [2020-10-16 04:47:33,834 INFO L130 PetriNetUnfolder]: For 1881/2123 co-relation queries the response was YES. [2020-10-16 04:47:33,838 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 803 events. 434/803 cut-off events. For 1881/2123 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4540 event pairs, 160 based on Foata normal form. 8/752 useless extension candidates. Maximal degree in co-relation 2564. Up to 460 conditions per place. [2020-10-16 04:47:33,846 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 14 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2020-10-16 04:47:33,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 303 flow [2020-10-16 04:47:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2020-10-16 04:47:33,849 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2020-10-16 04:47:33,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2020-10-16 04:47:33,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2020-10-16 04:47:33,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:33,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2020-10-16 04:47:33,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:33,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:33,853 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:33,853 INFO L185 Difference]: Start difference. First operand has 49 places, 43 transitions, 225 flow. Second operand 3 states and 484 transitions. [2020-10-16 04:47:33,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 303 flow [2020-10-16 04:47:33,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 285 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:33,860 INFO L241 Difference]: Finished difference. Result has 50 places, 47 transitions, 267 flow [2020-10-16 04:47:33,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2020-10-16 04:47:33,861 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 04:47:33,861 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 267 flow [2020-10-16 04:47:33,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:33,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:33,861 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:33,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:47:33,862 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:33,862 INFO L82 PathProgramCache]: Analyzing trace with hash -817630389, now seen corresponding path program 1 times [2020-10-16 04:47:33,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:33,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63360054] [2020-10-16 04:47:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:34,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63360054] [2020-10-16 04:47:34,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:34,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:34,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720715191] [2020-10-16 04:47:34,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:47:34,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:47:34,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:47:34,041 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 196 [2020-10-16 04:47:34,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 267 flow. Second operand 5 states. [2020-10-16 04:47:34,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:34,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 196 [2020-10-16 04:47:34,042 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:34,265 INFO L129 PetriNetUnfolder]: 403/748 cut-off events. [2020-10-16 04:47:34,266 INFO L130 PetriNetUnfolder]: For 2758/3059 co-relation queries the response was YES. [2020-10-16 04:47:34,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 748 events. 403/748 cut-off events. For 2758/3059 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4228 event pairs, 134 based on Foata normal form. 17/704 useless extension candidates. Maximal degree in co-relation 2579. Up to 417 conditions per place. [2020-10-16 04:47:34,276 INFO L132 encePairwiseOnDemand]: 191/196 looper letters, 22 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2020-10-16 04:47:34,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 378 flow [2020-10-16 04:47:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2020-10-16 04:47:34,278 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7993197278911565 [2020-10-16 04:47:34,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2020-10-16 04:47:34,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2020-10-16 04:47:34,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:34,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2020-10-16 04:47:34,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:34,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:34,281 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:34,281 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 267 flow. Second operand 3 states and 470 transitions. [2020-10-16 04:47:34,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 378 flow [2020-10-16 04:47:34,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:34,285 INFO L241 Difference]: Finished difference. Result has 52 places, 52 transitions, 312 flow [2020-10-16 04:47:34,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2020-10-16 04:47:34,286 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2020-10-16 04:47:34,286 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 312 flow [2020-10-16 04:47:34,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:47:34,286 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:34,286 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:34,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:47:34,287 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1351424573, now seen corresponding path program 1 times [2020-10-16 04:47:34,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:34,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418828278] [2020-10-16 04:47:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:34,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418828278] [2020-10-16 04:47:34,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:34,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:47:34,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009019755] [2020-10-16 04:47:34,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:47:34,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:47:34,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:47:34,571 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 196 [2020-10-16 04:47:34,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 312 flow. Second operand 6 states. [2020-10-16 04:47:34,572 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:34,572 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 196 [2020-10-16 04:47:34,572 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:34,830 INFO L129 PetriNetUnfolder]: 430/807 cut-off events. [2020-10-16 04:47:34,831 INFO L130 PetriNetUnfolder]: For 4143/4651 co-relation queries the response was YES. [2020-10-16 04:47:34,837 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 807 events. 430/807 cut-off events. For 4143/4651 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4702 event pairs, 84 based on Foata normal form. 37/779 useless extension candidates. Maximal degree in co-relation 3022. Up to 433 conditions per place. [2020-10-16 04:47:34,844 INFO L132 encePairwiseOnDemand]: 189/196 looper letters, 19 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2020-10-16 04:47:34,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 421 flow [2020-10-16 04:47:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:47:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:47:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2020-10-16 04:47:34,849 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8122448979591836 [2020-10-16 04:47:34,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2020-10-16 04:47:34,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2020-10-16 04:47:34,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:34,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2020-10-16 04:47:34,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:47:34,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:47:34,856 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:47:34,856 INFO L185 Difference]: Start difference. First operand has 52 places, 52 transitions, 312 flow. Second operand 5 states and 796 transitions. [2020-10-16 04:47:34,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 421 flow [2020-10-16 04:47:34,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:34,862 INFO L241 Difference]: Finished difference. Result has 57 places, 55 transitions, 370 flow [2020-10-16 04:47:34,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2020-10-16 04:47:34,863 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2020-10-16 04:47:34,863 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 370 flow [2020-10-16 04:47:34,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:47:34,863 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:34,863 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:34,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:47:34,864 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -739329253, now seen corresponding path program 1 times [2020-10-16 04:47:34,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:34,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406550803] [2020-10-16 04:47:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:34,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406550803] [2020-10-16 04:47:34,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:34,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:34,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084309951] [2020-10-16 04:47:34,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:34,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:34,916 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 196 [2020-10-16 04:47:34,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 370 flow. Second operand 4 states. [2020-10-16 04:47:34,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:34,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 196 [2020-10-16 04:47:34,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:35,420 INFO L129 PetriNetUnfolder]: 961/1704 cut-off events. [2020-10-16 04:47:35,420 INFO L130 PetriNetUnfolder]: For 5850/5892 co-relation queries the response was YES. [2020-10-16 04:47:35,430 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 1704 events. 961/1704 cut-off events. For 5850/5892 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10876 event pairs, 229 based on Foata normal form. 39/1670 useless extension candidates. Maximal degree in co-relation 6382. Up to 804 conditions per place. [2020-10-16 04:47:35,442 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 36 selfloop transitions, 10 changer transitions 1/76 dead transitions. [2020-10-16 04:47:35,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 591 flow [2020-10-16 04:47:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2020-10-16 04:47:35,445 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2020-10-16 04:47:35,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2020-10-16 04:47:35,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2020-10-16 04:47:35,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:35,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2020-10-16 04:47:35,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:35,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:35,449 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:35,449 INFO L185 Difference]: Start difference. First operand has 57 places, 55 transitions, 370 flow. Second operand 4 states and 665 transitions. [2020-10-16 04:47:35,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 591 flow [2020-10-16 04:47:35,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 555 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:35,456 INFO L241 Difference]: Finished difference. Result has 60 places, 61 transitions, 429 flow [2020-10-16 04:47:35,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=60, PETRI_TRANSITIONS=61} [2020-10-16 04:47:35,457 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2020-10-16 04:47:35,457 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 61 transitions, 429 flow [2020-10-16 04:47:35,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:35,457 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:35,457 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:35,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:47:35,458 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash 914012222, now seen corresponding path program 1 times [2020-10-16 04:47:35,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:35,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557720257] [2020-10-16 04:47:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:35,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557720257] [2020-10-16 04:47:35,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:35,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:35,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214817755] [2020-10-16 04:47:35,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:35,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:35,525 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2020-10-16 04:47:35,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 61 transitions, 429 flow. Second operand 4 states. [2020-10-16 04:47:35,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:35,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2020-10-16 04:47:35,526 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:35,935 INFO L129 PetriNetUnfolder]: 1361/2497 cut-off events. [2020-10-16 04:47:35,935 INFO L130 PetriNetUnfolder]: For 9525/10699 co-relation queries the response was YES. [2020-10-16 04:47:35,953 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8669 conditions, 2497 events. 1361/2497 cut-off events. For 9525/10699 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 18333 event pairs, 517 based on Foata normal form. 385/2615 useless extension candidates. Maximal degree in co-relation 8643. Up to 1150 conditions per place. [2020-10-16 04:47:35,969 INFO L132 encePairwiseOnDemand]: 189/196 looper letters, 12 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2020-10-16 04:47:35,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 499 flow [2020-10-16 04:47:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:47:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:47:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2020-10-16 04:47:35,973 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8489795918367347 [2020-10-16 04:47:35,973 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2020-10-16 04:47:35,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2020-10-16 04:47:35,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:35,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2020-10-16 04:47:35,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:47:35,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:47:35,977 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:47:35,977 INFO L185 Difference]: Start difference. First operand has 60 places, 61 transitions, 429 flow. Second operand 5 states and 832 transitions. [2020-10-16 04:47:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 499 flow [2020-10-16 04:47:35,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 473 flow, removed 11 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:35,991 INFO L241 Difference]: Finished difference. Result has 66 places, 70 transitions, 486 flow [2020-10-16 04:47:35,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2020-10-16 04:47:35,992 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2020-10-16 04:47:35,992 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 486 flow [2020-10-16 04:47:35,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:35,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:35,992 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:35,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:47:35,993 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:35,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1084338253, now seen corresponding path program 1 times [2020-10-16 04:47:35,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:35,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654906521] [2020-10-16 04:47:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:36,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654906521] [2020-10-16 04:47:36,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:36,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:47:36,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025930346] [2020-10-16 04:47:36,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:47:36,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:47:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:47:36,267 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 196 [2020-10-16 04:47:36,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 486 flow. Second operand 7 states. [2020-10-16 04:47:36,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:36,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 196 [2020-10-16 04:47:36,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:36,936 INFO L129 PetriNetUnfolder]: 1919/3522 cut-off events. [2020-10-16 04:47:36,936 INFO L130 PetriNetUnfolder]: For 18278/20888 co-relation queries the response was YES. [2020-10-16 04:47:36,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14422 conditions, 3522 events. 1919/3522 cut-off events. For 18278/20888 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 27718 event pairs, 515 based on Foata normal form. 207/3260 useless extension candidates. Maximal degree in co-relation 14392. Up to 1895 conditions per place. [2020-10-16 04:47:36,994 INFO L132 encePairwiseOnDemand]: 190/196 looper letters, 21 selfloop transitions, 22 changer transitions 0/80 dead transitions. [2020-10-16 04:47:36,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 656 flow [2020-10-16 04:47:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:47:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:47:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2020-10-16 04:47:36,997 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7683673469387755 [2020-10-16 04:47:36,997 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2020-10-16 04:47:36,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2020-10-16 04:47:36,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:36,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2020-10-16 04:47:37,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:47:37,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:47:37,001 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:47:37,002 INFO L185 Difference]: Start difference. First operand has 66 places, 70 transitions, 486 flow. Second operand 5 states and 753 transitions. [2020-10-16 04:47:37,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 656 flow [2020-10-16 04:47:37,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:47:37,027 INFO L241 Difference]: Finished difference. Result has 71 places, 75 transitions, 612 flow [2020-10-16 04:47:37,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=612, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2020-10-16 04:47:37,027 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2020-10-16 04:47:37,028 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 612 flow [2020-10-16 04:47:37,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:47:37,028 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:37,028 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:37,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:47:37,028 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1138258648, now seen corresponding path program 1 times [2020-10-16 04:47:37,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:37,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243486587] [2020-10-16 04:47:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:37,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243486587] [2020-10-16 04:47:37,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:37,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:47:37,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669550751] [2020-10-16 04:47:37,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:47:37,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:47:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:47:37,101 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2020-10-16 04:47:37,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 612 flow. Second operand 5 states. [2020-10-16 04:47:37,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:37,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2020-10-16 04:47:37,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:37,713 INFO L129 PetriNetUnfolder]: 1265/2639 cut-off events. [2020-10-16 04:47:37,714 INFO L130 PetriNetUnfolder]: For 15373/25644 co-relation queries the response was YES. [2020-10-16 04:47:37,734 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 2639 events. 1265/2639 cut-off events. For 15373/25644 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 21995 event pairs, 220 based on Foata normal form. 1321/3690 useless extension candidates. Maximal degree in co-relation 11627. Up to 1560 conditions per place. [2020-10-16 04:47:37,760 INFO L132 encePairwiseOnDemand]: 189/196 looper letters, 11 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2020-10-16 04:47:37,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 740 flow [2020-10-16 04:47:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:47:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:47:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1165 transitions. [2020-10-16 04:47:37,764 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8491253644314869 [2020-10-16 04:47:37,764 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1165 transitions. [2020-10-16 04:47:37,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1165 transitions. [2020-10-16 04:47:37,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:37,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1165 transitions. [2020-10-16 04:47:37,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:47:37,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:47:37,770 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:47:37,770 INFO L185 Difference]: Start difference. First operand has 71 places, 75 transitions, 612 flow. Second operand 7 states and 1165 transitions. [2020-10-16 04:47:37,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 740 flow [2020-10-16 04:47:37,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:47:37,787 INFO L241 Difference]: Finished difference. Result has 78 places, 83 transitions, 731 flow [2020-10-16 04:47:37,789 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=731, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2020-10-16 04:47:37,789 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2020-10-16 04:47:37,789 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 731 flow [2020-10-16 04:47:37,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:47:37,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:37,789 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] [2020-10-16 04:47:37,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:47:37,790 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:37,790 INFO L82 PathProgramCache]: Analyzing trace with hash 341687910, now seen corresponding path program 1 times [2020-10-16 04:47:37,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:37,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467991390] [2020-10-16 04:47:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:37,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467991390] [2020-10-16 04:47:37,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:37,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:47:37,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241963197] [2020-10-16 04:47:37,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:47:37,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:47:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:47:37,909 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2020-10-16 04:47:37,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 731 flow. Second operand 6 states. [2020-10-16 04:47:37,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:37,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2020-10-16 04:47:37,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:38,335 INFO L129 PetriNetUnfolder]: 892/2042 cut-off events. [2020-10-16 04:47:38,336 INFO L130 PetriNetUnfolder]: For 18426/38080 co-relation queries the response was YES. [2020-10-16 04:47:38,355 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11118 conditions, 2042 events. 892/2042 cut-off events. For 18426/38080 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 17611 event pairs, 46 based on Foata normal form. 1821/3633 useless extension candidates. Maximal degree in co-relation 11082. Up to 1433 conditions per place. [2020-10-16 04:47:38,369 INFO L132 encePairwiseOnDemand]: 189/196 looper letters, 6 selfloop transitions, 28 changer transitions 5/96 dead transitions. [2020-10-16 04:47:38,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 935 flow [2020-10-16 04:47:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:47:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:47:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1498 transitions. [2020-10-16 04:47:38,375 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2020-10-16 04:47:38,375 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1498 transitions. [2020-10-16 04:47:38,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1498 transitions. [2020-10-16 04:47:38,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:38,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1498 transitions. [2020-10-16 04:47:38,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:47:38,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:47:38,381 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:47:38,382 INFO L185 Difference]: Start difference. First operand has 78 places, 83 transitions, 731 flow. Second operand 9 states and 1498 transitions. [2020-10-16 04:47:38,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 935 flow [2020-10-16 04:47:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 885 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 04:47:38,455 INFO L241 Difference]: Finished difference. Result has 86 places, 91 transitions, 843 flow [2020-10-16 04:47:38,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=843, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2020-10-16 04:47:38,455 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 44 predicate places. [2020-10-16 04:47:38,455 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 843 flow [2020-10-16 04:47:38,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:47:38,456 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:38,456 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] [2020-10-16 04:47:38,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:47:38,456 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:38,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:38,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1991322366, now seen corresponding path program 1 times [2020-10-16 04:47:38,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:38,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421813503] [2020-10-16 04:47:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:38,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421813503] [2020-10-16 04:47:38,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:38,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:47:38,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974690046] [2020-10-16 04:47:38,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:47:38,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:38,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:47:38,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:47:38,496 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 196 [2020-10-16 04:47:38,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 843 flow. Second operand 3 states. [2020-10-16 04:47:38,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:38,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 196 [2020-10-16 04:47:38,497 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:38,590 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L786-->L793: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_286 256) 0)) (.cse1 (= (mod v_~y$r_buff1_thd3~0_50 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_370 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_369 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_73 256) 0))) (let ((.cse6 (or .cse2 .cse13)) (.cse5 (not .cse2)) (.cse11 (or .cse12 .cse13)) (.cse7 (or .cse14 .cse1)) (.cse9 (not .cse14)) (.cse4 (not .cse1)) (.cse8 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse0 (= (mod v_~y$w_buff1_used~0_285 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (or (and (= v_~y$r_buff1_thd3~0_49 v_~y$r_buff1_thd3~0_50) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and .cse4 (not .cse0)) (and .cse5 (not .cse3))) (= 0 v_~y$r_buff1_thd3~0_49)))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse6 .cse7) (and (= v_~y$w_buff1_used~0_285 0) (or (and .cse8 .cse5) (and .cse9 .cse4)))) (or (and .cse8 (= v_~y$w_buff0_used~0_369 0) .cse10) (and .cse11 (= v_~y$w_buff0_used~0_370 v_~y$w_buff0_used~0_369))) (or (and .cse6 (= v_~y$r_buff0_thd3~0_73 v_~y$r_buff0_thd3~0_72)) (and .cse8 .cse5 (= v_~y$r_buff0_thd3~0_72 0))) (or (and .cse11 (= v_~y~0_127 |v_P2_#t~ite8_30|) (or (and (= v_~y~0_128 |v_P2_#t~ite8_30|) .cse7) (and .cse9 .cse4 (= |v_P2_#t~ite8_30| v_~y$w_buff1~0_93)))) (and .cse8 (= v_~y~0_127 v_~y$w_buff0~0_76) .cse10 (= |v_P2Thread1of1ForFork3_#t~ite8_1| |v_P2_#t~ite8_30|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~y$w_buff1~0=v_~y$w_buff1~0_93, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_73, ~y$w_buff0~0=v_~y$w_buff0~0_76, ~y~0=v_~y~0_128, P2Thread1of1ForFork3_#t~ite8=|v_P2Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_369, P2Thread1of1ForFork3_#t~ite11=|v_P2Thread1of1ForFork3_#t~ite11_1|, P2Thread1of1ForFork3_#t~ite12=|v_P2Thread1of1ForFork3_#t~ite12_1|, P2Thread1of1ForFork3_#t~ite13=|v_P2Thread1of1ForFork3_#t~ite13_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_93, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_76, P2Thread1of1ForFork3_#t~ite10=|v_P2Thread1of1ForFork3_#t~ite10_1|, P2Thread1of1ForFork3_#t~ite9=|v_P2Thread1of1ForFork3_#t~ite9_1|, ~y~0=v_~y~0_127, P2Thread1of1ForFork3_#t~ite8=|v_P2Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P2_#t~ite8_30|] AssignedVars[P2Thread1of1ForFork3_#t~ite11, P2Thread1of1ForFork3_#t~ite12, P2Thread1of1ForFork3_#t~ite13, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork3_#t~ite10, P2Thread1of1ForFork3_#t~ite9, ~y~0, P2Thread1of1ForFork3_#t~ite8, ~y$w_buff1_used~0][45], [64#L763true, Black: 130#(and (<= ~z~0 0) (<= ~y$w_buff0~0 0)), Black: 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 197#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), Black: 135#(<= ~z~0 0), 205#(and (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0) (= ~y$r_buff0_thd2~0 0)), Black: 140#(and (<= ~y$w_buff0~0 0) (<= ~__unbuffered_p3_EAX~0 0)), 16#L741true, Black: 206#(and (not (= ~y~0 ~y$w_buff0~0)) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0) (= ~y$r_buff0_thd2~0 0)), 22#L803true, 24#L793true, 216#(= ~__unbuffered_cnt~0 0), Black: 150#(and (= ~x~0 0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0)), Black: 217#(<= ~__unbuffered_cnt~0 1), Black: 157#(and (<= ~y~0 0) (= ~x~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), 229#(= ~__unbuffered_cnt~0 0), Black: 164#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0)), Black: 173#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= 0 ~y$r_buff0_thd0~0)), Black: 231#(<= ~__unbuffered_cnt~0 2), Black: 232#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 238#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork1InUse, 245#(= ~x~0 1), 54#L840-1true, Black: 179#(and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1) (< 0 (+ (div ~y$w_buff0_used~0 256) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))), P1Thread1of1ForFork2InUse, Black: 181#(and (= ~y~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), P2Thread1of1ForFork3InUse, P3Thread1of1ForFork0InUse, 187#(= ~z~0 1), Black: 188#(and (= ~y~0 1) (= ~y~0 ~z~0))]) [2020-10-16 04:47:38,591 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2020-10-16 04:47:38,591 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:38,591 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:38,591 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:39,036 INFO L129 PetriNetUnfolder]: 1476/3286 cut-off events. [2020-10-16 04:47:39,037 INFO L130 PetriNetUnfolder]: For 24263/29267 co-relation queries the response was YES. [2020-10-16 04:47:39,064 INFO L80 FinitePrefix]: Finished finitePrefix Result has 16826 conditions, 3286 events. 1476/3286 cut-off events. For 24263/29267 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 30449 event pairs, 99 based on Foata normal form. 162/3049 useless extension candidates. Maximal degree in co-relation 16787. Up to 1688 conditions per place. [2020-10-16 04:47:39,077 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 5 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2020-10-16 04:47:39,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 92 transitions, 867 flow [2020-10-16 04:47:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:47:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:47:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2020-10-16 04:47:39,080 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9030612244897959 [2020-10-16 04:47:39,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2020-10-16 04:47:39,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2020-10-16 04:47:39,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:39,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2020-10-16 04:47:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:47:39,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:47:39,084 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:47:39,084 INFO L185 Difference]: Start difference. First operand has 86 places, 91 transitions, 843 flow. Second operand 3 states and 531 transitions. [2020-10-16 04:47:39,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 92 transitions, 867 flow [2020-10-16 04:47:39,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 770 flow, removed 34 selfloop flow, removed 4 redundant places. [2020-10-16 04:47:39,502 INFO L241 Difference]: Finished difference. Result has 85 places, 92 transitions, 768 flow [2020-10-16 04:47:39,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2020-10-16 04:47:39,503 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2020-10-16 04:47:39,503 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 768 flow [2020-10-16 04:47:39,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:47:39,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:39,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] [2020-10-16 04:47:39,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:47:39,504 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1181768612, now seen corresponding path program 2 times [2020-10-16 04:47:39,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:39,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280391988] [2020-10-16 04:47:39,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:39,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280391988] [2020-10-16 04:47:39,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:39,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:47:39,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425176378] [2020-10-16 04:47:39,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:47:39,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:47:39,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:47:39,597 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 196 [2020-10-16 04:47:39,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 768 flow. Second operand 7 states. [2020-10-16 04:47:39,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:39,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 196 [2020-10-16 04:47:39,598 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:39,790 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([971] L786-->L793: Formula: (let ((.cse14 (= (mod v_~y$w_buff1_used~0_286 256) 0)) (.cse1 (= (mod v_~y$r_buff1_thd3~0_50 256) 0)) (.cse12 (= (mod v_~y$w_buff0_used~0_370 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_369 256) 0)) (.cse13 (= (mod v_~y$r_buff0_thd3~0_73 256) 0))) (let ((.cse6 (or .cse2 .cse13)) (.cse5 (not .cse2)) (.cse11 (or .cse12 .cse13)) (.cse7 (or .cse14 .cse1)) (.cse9 (not .cse14)) (.cse4 (not .cse1)) (.cse8 (not .cse13)) (.cse10 (not .cse12))) (and (let ((.cse0 (= (mod v_~y$w_buff1_used~0_285 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd3~0_72 256) 0))) (or (and (= v_~y$r_buff1_thd3~0_49 v_~y$r_buff1_thd3~0_50) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and .cse4 (not .cse0)) (and .cse5 (not .cse3))) (= 0 v_~y$r_buff1_thd3~0_49)))) (or (and (= v_~y$w_buff1_used~0_286 v_~y$w_buff1_used~0_285) .cse6 .cse7) (and (= v_~y$w_buff1_used~0_285 0) (or (and .cse8 .cse5) (and .cse9 .cse4)))) (or (and .cse8 (= v_~y$w_buff0_used~0_369 0) .cse10) (and .cse11 (= v_~y$w_buff0_used~0_370 v_~y$w_buff0_used~0_369))) (or (and .cse6 (= v_~y$r_buff0_thd3~0_73 v_~y$r_buff0_thd3~0_72)) (and .cse8 .cse5 (= v_~y$r_buff0_thd3~0_72 0))) (or (and .cse11 (= v_~y~0_127 |v_P2_#t~ite8_30|) (or (and (= v_~y~0_128 |v_P2_#t~ite8_30|) .cse7) (and .cse9 .cse4 (= |v_P2_#t~ite8_30| v_~y$w_buff1~0_93)))) (and .cse8 (= v_~y~0_127 v_~y$w_buff0~0_76) .cse10 (= |v_P2Thread1of1ForFork3_#t~ite8_1| |v_P2_#t~ite8_30|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~y$w_buff1~0=v_~y$w_buff1~0_93, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_73, ~y$w_buff0~0=v_~y$w_buff0~0_76, ~y~0=v_~y~0_128, P2Thread1of1ForFork3_#t~ite8=|v_P2Thread1of1ForFork3_#t~ite8_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_286} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_369, P2Thread1of1ForFork3_#t~ite11=|v_P2Thread1of1ForFork3_#t~ite11_1|, P2Thread1of1ForFork3_#t~ite12=|v_P2Thread1of1ForFork3_#t~ite12_1|, P2Thread1of1ForFork3_#t~ite13=|v_P2Thread1of1ForFork3_#t~ite13_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_93, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_72, ~y$w_buff0~0=v_~y$w_buff0~0_76, P2Thread1of1ForFork3_#t~ite10=|v_P2Thread1of1ForFork3_#t~ite10_1|, P2Thread1of1ForFork3_#t~ite9=|v_P2Thread1of1ForFork3_#t~ite9_1|, ~y~0=v_~y~0_127, P2Thread1of1ForFork3_#t~ite8=|v_P2Thread1of1ForFork3_#t~ite8_2|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_285} AuxVars[|v_P2_#t~ite8_30|] AssignedVars[P2Thread1of1ForFork3_#t~ite11, P2Thread1of1ForFork3_#t~ite12, P2Thread1of1ForFork3_#t~ite13, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork3_#t~ite10, P2Thread1of1ForFork3_#t~ite9, ~y~0, P2Thread1of1ForFork3_#t~ite8, ~y$w_buff1_used~0][45], [64#L763true, Black: 130#(and (<= ~z~0 0) (<= ~y$w_buff0~0 0)), Black: 195#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 135#(<= ~z~0 0), Black: 197#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|) (= ~__unbuffered_cnt~0 0)), 205#(and (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0) (= ~y$r_buff0_thd2~0 0)), Black: 140#(and (<= ~y$w_buff0~0 0) (<= ~__unbuffered_p3_EAX~0 0)), 16#L741true, Black: 206#(and (not (= ~y~0 ~y$w_buff0~0)) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0) (= ~y$r_buff0_thd2~0 0)), 22#L803true, 24#L793true, Black: 150#(and (= ~x~0 0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0)), 216#(= ~__unbuffered_cnt~0 0), Black: 217#(<= ~__unbuffered_cnt~0 1), Black: 157#(and (<= ~y~0 0) (= ~x~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256)))), Black: 218#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 164#(and (<= ~y~0 0) (<= ~y$w_buff1~0 0) (<= ~y$w_buff0~0 0)), Black: 173#(and (<= ~y~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= 0 ~y$r_buff0_thd0~0)), Black: 231#(<= ~__unbuffered_cnt~0 2), Black: 232#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), Black: 238#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= ~__unbuffered_cnt~0 2) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)), P0Thread1of1ForFork1InUse, 245#(= ~x~0 1), 54#L840-1true, Black: 179#(and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1) (< 0 (+ (div ~y$w_buff0_used~0 256) 1)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))), P1Thread1of1ForFork2InUse, Black: 181#(and (= ~y~0 1) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), P2Thread1of1ForFork3InUse, 250#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork0InUse, 187#(= ~z~0 1), Black: 188#(and (= ~y~0 1) (= ~y~0 ~z~0))]) [2020-10-16 04:47:39,790 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2020-10-16 04:47:39,790 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:39,790 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:39,790 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2020-10-16 04:47:40,176 INFO L129 PetriNetUnfolder]: 1392/3113 cut-off events. [2020-10-16 04:47:40,176 INFO L130 PetriNetUnfolder]: For 22837/34531 co-relation queries the response was YES. [2020-10-16 04:47:40,207 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14041 conditions, 3113 events. 1392/3113 cut-off events. For 22837/34531 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 29077 event pairs, 63 based on Foata normal form. 2381/5105 useless extension candidates. Maximal degree in co-relation 14001. Up to 848 conditions per place. [2020-10-16 04:47:40,215 INFO L132 encePairwiseOnDemand]: 189/196 looper letters, 2 selfloop transitions, 33 changer transitions 6/97 dead transitions. [2020-10-16 04:47:40,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 902 flow [2020-10-16 04:47:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:47:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:47:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1823 transitions. [2020-10-16 04:47:40,221 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8455473098330241 [2020-10-16 04:47:40,221 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1823 transitions. [2020-10-16 04:47:40,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1823 transitions. [2020-10-16 04:47:40,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:40,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1823 transitions. [2020-10-16 04:47:40,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:47:40,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:47:40,229 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:47:40,229 INFO L185 Difference]: Start difference. First operand has 85 places, 92 transitions, 768 flow. Second operand 11 states and 1823 transitions. [2020-10-16 04:47:40,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 902 flow [2020-10-16 04:47:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 868 flow, removed 11 selfloop flow, removed 3 redundant places. [2020-10-16 04:47:40,486 INFO L241 Difference]: Finished difference. Result has 95 places, 91 transitions, 820 flow [2020-10-16 04:47:40,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=820, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2020-10-16 04:47:40,486 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2020-10-16 04:47:40,486 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 820 flow [2020-10-16 04:47:40,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:47:40,487 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:40,487 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:40,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:47:40,487 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:40,487 INFO L82 PathProgramCache]: Analyzing trace with hash 150054561, now seen corresponding path program 1 times [2020-10-16 04:47:40,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:40,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730060951] [2020-10-16 04:47:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:47:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:47:40,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730060951] [2020-10-16 04:47:40,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:47:40,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:47:40,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975797295] [2020-10-16 04:47:40,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:47:40,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:47:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:47:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:47:40,539 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 196 [2020-10-16 04:47:40,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 820 flow. Second operand 4 states. [2020-10-16 04:47:40,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:47:40,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 196 [2020-10-16 04:47:40,540 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:47:41,005 INFO L129 PetriNetUnfolder]: 1863/4108 cut-off events. [2020-10-16 04:47:41,005 INFO L130 PetriNetUnfolder]: For 22632/25119 co-relation queries the response was YES. [2020-10-16 04:47:41,035 INFO L80 FinitePrefix]: Finished finitePrefix Result has 18527 conditions, 4108 events. 1863/4108 cut-off events. For 22632/25119 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 40293 event pairs, 53 based on Foata normal form. 179/3827 useless extension candidates. Maximal degree in co-relation 18485. Up to 1140 conditions per place. [2020-10-16 04:47:41,044 INFO L132 encePairwiseOnDemand]: 193/196 looper letters, 3 selfloop transitions, 2 changer transitions 24/92 dead transitions. [2020-10-16 04:47:41,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 832 flow [2020-10-16 04:47:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:47:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:47:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2020-10-16 04:47:41,047 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8903061224489796 [2020-10-16 04:47:41,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2020-10-16 04:47:41,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2020-10-16 04:47:41,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:47:41,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2020-10-16 04:47:41,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:47:41,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:47:41,051 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:47:41,051 INFO L185 Difference]: Start difference. First operand has 95 places, 91 transitions, 820 flow. Second operand 4 states and 698 transitions. [2020-10-16 04:47:41,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 832 flow [2020-10-16 04:47:41,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 709 flow, removed 31 selfloop flow, removed 10 redundant places. [2020-10-16 04:47:41,615 INFO L241 Difference]: Finished difference. Result has 89 places, 68 transitions, 491 flow [2020-10-16 04:47:41,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2020-10-16 04:47:41,615 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2020-10-16 04:47:41,615 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 491 flow [2020-10-16 04:47:41,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:47:41,615 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:47:41,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:47:41,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:47:41,616 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:47:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:47:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 723859383, now seen corresponding path program 2 times [2020-10-16 04:47:41,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:47:41,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554227551] [2020-10-16 04:47:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:47:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:41,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:47:41,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:47:41,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:47:41,737 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:47:41,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:47:41,740 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:47:41,764 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In167859230 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In167859230 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In167859230 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In167859230 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse4 (or .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out167859230)) (= ~y$r_buff0_thd0~0_In167859230 ~y$r_buff0_thd0~0_Out167859230) (or (and .cse0 (= ~y~0_Out167859230 ~y$w_buff0~0_In167859230) .cse1) (and (or (and (= ~y~0_Out167859230 ~y$w_buff1~0_In167859230) .cse2 .cse3) (and (= ~y~0_Out167859230 ~y~0_In167859230) .cse4)) .cse5)) (or (and .cse0 (= ~y$w_buff0_used~0_Out167859230 0) .cse1) (and .cse5 (= ~y$w_buff0_used~0_Out167859230 ~y$w_buff0_used~0_In167859230))) (= ~y$r_buff1_thd0~0_In167859230 ~y$r_buff1_thd0~0_Out167859230) (or (and (= ~y$w_buff1_used~0_Out167859230 ~y$w_buff1_used~0_In167859230) .cse4) (and .cse2 (= ~y$w_buff1_used~0_Out167859230 0) .cse3)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In167859230| ULTIMATE.start_assume_abort_if_not_~cond_Out167859230)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In167859230|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In167859230, ~y$w_buff1~0=~y$w_buff1~0_In167859230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In167859230, ~y$w_buff0~0=~y$w_buff0~0_In167859230, ~y~0=~y~0_In167859230, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167859230, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167859230} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out167859230, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out167859230|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out167859230|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out167859230|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out167859230|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out167859230|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out167859230|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In167859230|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out167859230, ~y$w_buff1~0=~y$w_buff1~0_In167859230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out167859230, ~y$w_buff0~0=~y$w_buff0~0_In167859230, ~y~0=~y~0_Out167859230, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out167859230, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out167859230} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 04:47:41,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,800 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 04:47:41,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:47:41,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:47:41 BasicIcfg [2020-10-16 04:47:41,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:47:41,901 INFO L168 Benchmark]: Toolchain (without parser) took 21576.27 ms. Allocated memory was 253.2 MB in the beginning and 915.9 MB in the end (delta: 662.7 MB). Free memory was 208.4 MB in the beginning and 379.7 MB in the end (delta: -171.4 MB). Peak memory consumption was 491.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,902 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:47:41,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.96 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 208.4 MB in the beginning and 268.6 MB in the end (delta: -60.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.42 ms. Allocated memory is still 320.3 MB. Free memory was 268.6 MB in the beginning and 266.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,904 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 320.3 MB. Free memory was 266.1 MB in the beginning and 263.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,905 INFO L168 Benchmark]: RCFGBuilder took 1964.86 ms. Allocated memory was 320.3 MB in the beginning and 363.3 MB in the end (delta: 43.0 MB). Free memory was 263.6 MB in the beginning and 186.5 MB in the end (delta: 77.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,906 INFO L168 Benchmark]: TraceAbstraction took 18742.80 ms. Allocated memory was 363.3 MB in the beginning and 915.9 MB in the end (delta: 552.6 MB). Free memory was 183.2 MB in the beginning and 379.7 MB in the end (delta: -196.5 MB). Peak memory consumption was 356.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:47:41,910 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.31 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 757.96 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 208.4 MB in the beginning and 268.6 MB in the end (delta: -60.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.42 ms. Allocated memory is still 320.3 MB. Free memory was 268.6 MB in the beginning and 266.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 320.3 MB. Free memory was 266.1 MB in the beginning and 263.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1964.86 ms. Allocated memory was 320.3 MB in the beginning and 363.3 MB in the end (delta: 43.0 MB). Free memory was 263.6 MB in the beginning and 186.5 MB in the end (delta: 77.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 18742.80 ms. Allocated memory was 363.3 MB in the beginning and 915.9 MB in the end (delta: 552.6 MB). Free memory was 183.2 MB in the beginning and 379.7 MB in the end (delta: -196.5 MB). Peak memory consumption was 356.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1846 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 234 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 117 PlacesBefore, 42 PlacesAfterwards, 106 TransitionsBefore, 29 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 6617 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t813; [L834] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L835] 0 pthread_t t814; [L836] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L837] 0 pthread_t t815; [L838] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L839] 0 pthread_t t816; [L840] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L802] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L758] 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) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] 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) [L758] 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) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 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 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 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 [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L788] 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) [L788] 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) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 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 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 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 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] 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) [L857] 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) [L858] 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)) [L858] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] 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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 5 procedures, 109 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: 18.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 101 SDtfs, 38 SDslu, 25 SDs, 0 SdLazy, 354 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=843occurred 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.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 33884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...