/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:31:07,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:31:07,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:31:07,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:31:07,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:31:07,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:31:07,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:31:07,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:31:07,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:31:07,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:31:07,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:31:07,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:31:07,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:31:07,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:31:07,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:31:07,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:31:07,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:31:07,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:31:07,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:31:07,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:31:07,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:31:07,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:31:07,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:31:07,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:31:07,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:31:07,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:31:07,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:31:07,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:31:07,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:31:07,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:31:07,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:31:07,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:31:07,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:31:07,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:31:07,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:31:07,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:31:07,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:31:07,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:31:07,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:31:07,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:31:07,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:31:07,166 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.epf [2020-10-16 01:31:07,203 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:31:07,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:31:07,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:31:07,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:31:07,206 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:31:07,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:31:07,207 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:31:07,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:31:07,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:31:07,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:31:07,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:31:07,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:31:07,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:31:07,209 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:31:07,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:31:07,209 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:31:07,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:31:07,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:31:07,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:31:07,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:31:07,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:31:07,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:31:07,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:31:07,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:31:07,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:31:07,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:31:07,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:31:07,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:31:07,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:31:07,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:31:07,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:31:07,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:31:07,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:31:07,532 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:31:07,533 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-16 01:31:07,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc9a1fb/dc860cbcbfaf4fa8a36a39d0668bcf4a/FLAGc5fb8eec0 [2020-10-16 01:31:08,169 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:31:08,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_rmo.opt.i [2020-10-16 01:31:08,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc9a1fb/dc860cbcbfaf4fa8a36a39d0668bcf4a/FLAGc5fb8eec0 [2020-10-16 01:31:08,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dc9a1fb/dc860cbcbfaf4fa8a36a39d0668bcf4a [2020-10-16 01:31:08,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:31:08,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:31:08,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:08,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:31:08,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:31:08,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:08" (1/1) ... [2020-10-16 01:31:08,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:08, skipping insertion in model container [2020-10-16 01:31:08,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:31:08" (1/1) ... [2020-10-16 01:31:08,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:31:08,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:31:09,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:09,193 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:31:09,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:31:09,332 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:31:09,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09 WrapperNode [2020-10-16 01:31:09,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:31:09,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:09,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:31:09,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:31:09,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:31:09,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:31:09,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:31:09,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:31:09,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (1/1) ... [2020-10-16 01:31:09,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:31:09,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:31:09,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:31:09,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:31:09,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (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 01:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:31:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:31:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:31:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:31:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:31:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:31:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:31:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:31:09,530 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 01:31:09,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 01:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:31:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:31:09,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:31:09,532 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 01:31:11,623 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:31:11,623 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:31:11,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:11 BoogieIcfgContainer [2020-10-16 01:31:11,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:31:11,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:31:11,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:31:11,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:31:11,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:31:08" (1/3) ... [2020-10-16 01:31:11,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:11, skipping insertion in model container [2020-10-16 01:31:11,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:31:09" (2/3) ... [2020-10-16 01:31:11,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e4539f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:31:11, skipping insertion in model container [2020-10-16 01:31:11,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:31:11" (3/3) ... [2020-10-16 01:31:11,638 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_rmo.opt.i [2020-10-16 01:31:11,650 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:31:11,659 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:31:11,660 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:31:11,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,714 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,715 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,716 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,719 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,720 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,720 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,720 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,720 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,720 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,721 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,722 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,723 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,729 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,731 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,733 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,736 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:31:11,756 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 01:31:11,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:31:11,776 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:31:11,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:31:11,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:31:11,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:31:11,777 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:31:11,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:31:11,777 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:31:11,791 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 01:31:11,864 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 01:31:11,865 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:11,874 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:31:11,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 01:31:11,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:11,893 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:31:11,897 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:11,902 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:11,903 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 114 places, 103 transitions, 218 flow [2020-10-16 01:31:11,962 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 01:31:11,962 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:11,966 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-16 01:31:11,972 INFO L117 LiptonReduction]: Number of co-enabled transitions 2352 [2020-10-16 01:31:12,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:12,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:12,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:12,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:12,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:12,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:12,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:12,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:12,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:12,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:12,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:12,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:12,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:12,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:12,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:12,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:12,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:12,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:12,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:12,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:12,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:31:12,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:12,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:12,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:13,544 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:31:13,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:31:13,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:13,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:31:13,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:14,802 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:31:14,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:14,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:14,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:14,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:14,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:14,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:14,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:14,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:14,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:14,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:14,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:14,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:14,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:14,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:14,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:14,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:14,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:14,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:15,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:15,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:15,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:15,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:15,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:15,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:15,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:15,302 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 01:31:15,651 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:31:15,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:15,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:15,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:15,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:15,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:15,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:15,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:15,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:15,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:15,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:15,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:15,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:15,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:15,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:16,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:16,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:16,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:16,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:16,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:16,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:16,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:16,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:16,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,066 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 01:31:17,449 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 01:31:17,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:17,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:17,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:17,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:17,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:17,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:17,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:17,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:17,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:19,129 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 01:31:19,533 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 01:31:20,163 WARN L193 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-10-16 01:31:20,458 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 01:31:20,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:20,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:31:20,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:20,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:20,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 01:31:20,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:20,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:31:20,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:20,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:31:20,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:31:20,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,407 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 01:31:21,734 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-16 01:31:21,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:21,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:21,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:21,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:21,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:21,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:21,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:31:21,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:31:21,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:31:21,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:21,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:31:21,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:31:22,258 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 01:31:22,383 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 01:31:22,430 INFO L132 LiptonReduction]: Checked pairs total: 6523 [2020-10-16 01:31:22,430 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-16 01:31:22,445 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10554 [2020-10-16 01:31:22,460 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2020-10-16 01:31:22,461 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:22,461 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:22,462 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:22,462 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1680903237, now seen corresponding path program 1 times [2020-10-16 01:31:22,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:22,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583743641] [2020-10-16 01:31:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:22,793 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 01:31:22,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583743641] [2020-10-16 01:31:22,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:22,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:22,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683808551] [2020-10-16 01:31:22,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:22,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:22,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:22,836 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2020-10-16 01:31:22,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states. [2020-10-16 01:31:22,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:22,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2020-10-16 01:31:22,844 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:22,940 INFO L129 PetriNetUnfolder]: 23/69 cut-off events. [2020-10-16 01:31:22,940 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:22,941 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 69 events. 23/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 217 event pairs, 9 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 119. Up to 37 conditions per place. [2020-10-16 01:31:22,942 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 7 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2020-10-16 01:31:22,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 94 flow [2020-10-16 01:31:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2020-10-16 01:31:22,961 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8487972508591065 [2020-10-16 01:31:22,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2020-10-16 01:31:22,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2020-10-16 01:31:22,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:22,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2020-10-16 01:31:22,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:22,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:22,981 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:22,983 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 494 transitions. [2020-10-16 01:31:22,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 94 flow [2020-10-16 01:31:22,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:31:22,989 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2020-10-16 01:31:22,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2020-10-16 01:31:22,993 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 01:31:22,993 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2020-10-16 01:31:22,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:22,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:22,994 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:22,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:31:22,994 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:22,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 440307498, now seen corresponding path program 1 times [2020-10-16 01:31:22,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:22,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290624682] [2020-10-16 01:31:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:23,120 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 01:31:23,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290624682] [2020-10-16 01:31:23,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:23,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:23,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574916197] [2020-10-16 01:31:23,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:23,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:23,127 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 01:31:23,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states. [2020-10-16 01:31:23,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:23,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 01:31:23,128 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:23,147 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2020-10-16 01:31:23,147 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:31:23,148 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2020-10-16 01:31:23,148 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2020-10-16 01:31:23,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 78 flow [2020-10-16 01:31:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2020-10-16 01:31:23,152 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625429553264605 [2020-10-16 01:31:23,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2020-10-16 01:31:23,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2020-10-16 01:31:23,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:23,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2020-10-16 01:31:23,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:23,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:23,156 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:23,156 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 502 transitions. [2020-10-16 01:31:23,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 78 flow [2020-10-16 01:31:23,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:23,158 INFO L241 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2020-10-16 01:31:23,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2020-10-16 01:31:23,159 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2020-10-16 01:31:23,159 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2020-10-16 01:31:23,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:23,159 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:23,160 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:23,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:31:23,160 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:23,160 INFO L82 PathProgramCache]: Analyzing trace with hash 764630339, now seen corresponding path program 1 times [2020-10-16 01:31:23,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:23,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40019659] [2020-10-16 01:31:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:23,234 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 01:31:23,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40019659] [2020-10-16 01:31:23,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:23,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:23,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909795273] [2020-10-16 01:31:23,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:23,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:23,237 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 01:31:23,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states. [2020-10-16 01:31:23,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:23,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 01:31:23,238 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:23,372 INFO L129 PetriNetUnfolder]: 195/378 cut-off events. [2020-10-16 01:31:23,373 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2020-10-16 01:31:23,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 378 events. 195/378 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1866 event pairs, 112 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 739. Up to 267 conditions per place. [2020-10-16 01:31:23,386 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2020-10-16 01:31:23,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 113 flow [2020-10-16 01:31:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2020-10-16 01:31:23,389 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7920962199312714 [2020-10-16 01:31:23,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2020-10-16 01:31:23,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2020-10-16 01:31:23,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:23,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2020-10-16 01:31:23,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:23,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:23,395 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:23,395 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 461 transitions. [2020-10-16 01:31:23,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 113 flow [2020-10-16 01:31:23,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:23,397 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 100 flow [2020-10-16 01:31:23,397 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=74, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2020-10-16 01:31:23,398 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2020-10-16 01:31:23,398 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 100 flow [2020-10-16 01:31:23,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:23,398 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:23,398 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:23,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:31:23,399 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2069270506, now seen corresponding path program 1 times [2020-10-16 01:31:23,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:23,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474792868] [2020-10-16 01:31:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:23,464 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 01:31:23,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474792868] [2020-10-16 01:31:23,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:23,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:31:23,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125675898] [2020-10-16 01:31:23,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:31:23,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:31:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:31:23,467 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 01:31:23,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 100 flow. Second operand 4 states. [2020-10-16 01:31:23,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:23,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 01:31:23,468 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:23,587 INFO L129 PetriNetUnfolder]: 230/444 cut-off events. [2020-10-16 01:31:23,588 INFO L130 PetriNetUnfolder]: For 180/186 co-relation queries the response was YES. [2020-10-16 01:31:23,591 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 444 events. 230/444 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2294 event pairs, 46 based on Foata normal form. 7/419 useless extension candidates. Maximal degree in co-relation 1053. Up to 262 conditions per place. [2020-10-16 01:31:23,595 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 14 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2020-10-16 01:31:23,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 176 flow [2020-10-16 01:31:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2020-10-16 01:31:23,598 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7912371134020618 [2020-10-16 01:31:23,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2020-10-16 01:31:23,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2020-10-16 01:31:23,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:23,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2020-10-16 01:31:23,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:23,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:23,602 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:23,602 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 100 flow. Second operand 4 states and 614 transitions. [2020-10-16 01:31:23,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 176 flow [2020-10-16 01:31:23,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:23,605 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 144 flow [2020-10-16 01:31:23,606 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2020-10-16 01:31:23,606 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2020-10-16 01:31:23,606 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 144 flow [2020-10-16 01:31:23,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:31:23,606 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:23,606 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:23,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:31:23,607 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2066264129, now seen corresponding path program 1 times [2020-10-16 01:31:23,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:23,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853684642] [2020-10-16 01:31:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:23,695 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 01:31:23,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853684642] [2020-10-16 01:31:23,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:23,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:31:23,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565363528] [2020-10-16 01:31:23,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:23,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:23,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:23,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:23,699 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 194 [2020-10-16 01:31:23,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 144 flow. Second operand 3 states. [2020-10-16 01:31:23,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:23,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 194 [2020-10-16 01:31:23,699 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:23,849 INFO L129 PetriNetUnfolder]: 259/503 cut-off events. [2020-10-16 01:31:23,849 INFO L130 PetriNetUnfolder]: For 489/543 co-relation queries the response was YES. [2020-10-16 01:31:23,856 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 503 events. 259/503 cut-off events. For 489/543 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2688 event pairs, 79 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 1321. Up to 289 conditions per place. [2020-10-16 01:31:23,862 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 9 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2020-10-16 01:31:23,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 197 flow [2020-10-16 01:31:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2020-10-16 01:31:23,865 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2020-10-16 01:31:23,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2020-10-16 01:31:23,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2020-10-16 01:31:23,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:23,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2020-10-16 01:31:23,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:23,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:23,870 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:23,870 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 144 flow. Second operand 3 states and 464 transitions. [2020-10-16 01:31:23,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 197 flow [2020-10-16 01:31:23,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 188 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:23,878 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 183 flow [2020-10-16 01:31:23,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2020-10-16 01:31:23,879 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2020-10-16 01:31:23,879 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 183 flow [2020-10-16 01:31:23,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:23,879 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:23,879 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:23,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:31:23,880 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2066268283, now seen corresponding path program 1 times [2020-10-16 01:31:23,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:23,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041687685] [2020-10-16 01:31:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:23,964 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 01:31:23,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041687685] [2020-10-16 01:31:23,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:23,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:31:23,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212764592] [2020-10-16 01:31:23,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:31:23,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:31:23,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:31:23,968 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 01:31:23,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 183 flow. Second operand 4 states. [2020-10-16 01:31:23,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:23,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 01:31:23,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:24,148 INFO L129 PetriNetUnfolder]: 292/557 cut-off events. [2020-10-16 01:31:24,148 INFO L130 PetriNetUnfolder]: For 805/854 co-relation queries the response was YES. [2020-10-16 01:31:24,152 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 557 events. 292/557 cut-off events. For 805/854 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2934 event pairs, 128 based on Foata normal form. 13/553 useless extension candidates. Maximal degree in co-relation 1585. Up to 351 conditions per place. [2020-10-16 01:31:24,157 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 15 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2020-10-16 01:31:24,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 245 flow [2020-10-16 01:31:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2020-10-16 01:31:24,160 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7925257731958762 [2020-10-16 01:31:24,161 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2020-10-16 01:31:24,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2020-10-16 01:31:24,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:24,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2020-10-16 01:31:24,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:24,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:24,165 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:24,165 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 183 flow. Second operand 4 states and 615 transitions. [2020-10-16 01:31:24,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 245 flow [2020-10-16 01:31:24,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:24,170 INFO L241 Difference]: Finished difference. Result has 48 places, 40 transitions, 210 flow [2020-10-16 01:31:24,171 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2020-10-16 01:31:24,171 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2020-10-16 01:31:24,171 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 210 flow [2020-10-16 01:31:24,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:31:24,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:24,171 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:24,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:31:24,172 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 277123388, now seen corresponding path program 1 times [2020-10-16 01:31:24,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:24,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576832770] [2020-10-16 01:31:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:24,242 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 01:31:24,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576832770] [2020-10-16 01:31:24,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:24,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:24,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919870143] [2020-10-16 01:31:24,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:24,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:24,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:24,247 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 194 [2020-10-16 01:31:24,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 210 flow. Second operand 5 states. [2020-10-16 01:31:24,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:24,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 194 [2020-10-16 01:31:24,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:24,433 INFO L129 PetriNetUnfolder]: 319/748 cut-off events. [2020-10-16 01:31:24,467 INFO L130 PetriNetUnfolder]: For 1468/1508 co-relation queries the response was YES. [2020-10-16 01:31:24,471 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 748 events. 319/748 cut-off events. For 1468/1508 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5187 event pairs, 132 based on Foata normal form. 39/748 useless extension candidates. Maximal degree in co-relation 2032. Up to 266 conditions per place. [2020-10-16 01:31:24,477 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 15 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2020-10-16 01:31:24,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 278 flow [2020-10-16 01:31:24,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2020-10-16 01:31:24,482 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.777319587628866 [2020-10-16 01:31:24,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 754 transitions. [2020-10-16 01:31:24,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 754 transitions. [2020-10-16 01:31:24,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:24,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 754 transitions. [2020-10-16 01:31:24,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:24,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:24,487 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:24,487 INFO L185 Difference]: Start difference. First operand has 48 places, 40 transitions, 210 flow. Second operand 5 states and 754 transitions. [2020-10-16 01:31:24,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 278 flow [2020-10-16 01:31:24,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 264 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:24,493 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 237 flow [2020-10-16 01:31:24,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2020-10-16 01:31:24,495 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2020-10-16 01:31:24,495 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 237 flow [2020-10-16 01:31:24,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:24,496 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:24,496 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:24,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:31:24,496 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash 370284061, now seen corresponding path program 1 times [2020-10-16 01:31:24,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:24,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064900973] [2020-10-16 01:31:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:24,578 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 01:31:24,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064900973] [2020-10-16 01:31:24,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:24,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:31:24,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576380276] [2020-10-16 01:31:24,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:31:24,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:31:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:31:24,583 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 194 [2020-10-16 01:31:24,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 237 flow. Second operand 4 states. [2020-10-16 01:31:24,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:24,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 194 [2020-10-16 01:31:24,584 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:24,731 INFO L129 PetriNetUnfolder]: 221/535 cut-off events. [2020-10-16 01:31:24,731 INFO L130 PetriNetUnfolder]: For 2047/2167 co-relation queries the response was YES. [2020-10-16 01:31:24,734 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 535 events. 221/535 cut-off events. For 2047/2167 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3421 event pairs, 52 based on Foata normal form. 6/505 useless extension candidates. Maximal degree in co-relation 1736. Up to 302 conditions per place. [2020-10-16 01:31:24,740 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 8 selfloop transitions, 12 changer transitions 1/49 dead transitions. [2020-10-16 01:31:24,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 333 flow [2020-10-16 01:31:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2020-10-16 01:31:24,744 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7976804123711341 [2020-10-16 01:31:24,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 619 transitions. [2020-10-16 01:31:24,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 619 transitions. [2020-10-16 01:31:24,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:24,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 619 transitions. [2020-10-16 01:31:24,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:24,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:24,748 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:24,748 INFO L185 Difference]: Start difference. First operand has 52 places, 41 transitions, 237 flow. Second operand 4 states and 619 transitions. [2020-10-16 01:31:24,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 333 flow [2020-10-16 01:31:24,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 318 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:24,757 INFO L241 Difference]: Finished difference. Result has 54 places, 45 transitions, 279 flow [2020-10-16 01:31:24,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2020-10-16 01:31:24,757 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2020-10-16 01:31:24,758 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 279 flow [2020-10-16 01:31:24,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:31:24,758 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:24,758 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:24,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:31:24,758 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash -850800813, now seen corresponding path program 1 times [2020-10-16 01:31:24,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:24,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315590549] [2020-10-16 01:31:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:24,921 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 01:31:24,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315590549] [2020-10-16 01:31:24,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:24,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:24,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814111574] [2020-10-16 01:31:24,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:24,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:24,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:24,925 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194 [2020-10-16 01:31:24,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 279 flow. Second operand 5 states. [2020-10-16 01:31:24,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:24,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194 [2020-10-16 01:31:24,926 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:25,108 INFO L129 PetriNetUnfolder]: 212/551 cut-off events. [2020-10-16 01:31:25,109 INFO L130 PetriNetUnfolder]: For 2251/2361 co-relation queries the response was YES. [2020-10-16 01:31:25,112 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 551 events. 212/551 cut-off events. For 2251/2361 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3645 event pairs, 29 based on Foata normal form. 13/532 useless extension candidates. Maximal degree in co-relation 1891. Up to 288 conditions per place. [2020-10-16 01:31:25,118 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 14 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2020-10-16 01:31:25,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 335 flow [2020-10-16 01:31:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2020-10-16 01:31:25,123 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7551546391752577 [2020-10-16 01:31:25,124 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2020-10-16 01:31:25,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2020-10-16 01:31:25,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:25,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2020-10-16 01:31:25,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:25,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:25,129 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:25,130 INFO L185 Difference]: Start difference. First operand has 54 places, 45 transitions, 279 flow. Second operand 4 states and 586 transitions. [2020-10-16 01:31:25,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 335 flow [2020-10-16 01:31:25,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 320 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:25,136 INFO L241 Difference]: Finished difference. Result has 57 places, 47 transitions, 295 flow [2020-10-16 01:31:25,137 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2020-10-16 01:31:25,137 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2020-10-16 01:31:25,137 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 295 flow [2020-10-16 01:31:25,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:25,137 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:25,138 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:25,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:31:25,138 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash -700585377, now seen corresponding path program 2 times [2020-10-16 01:31:25,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:25,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630002642] [2020-10-16 01:31:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:25,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630002642] [2020-10-16 01:31:25,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:25,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:25,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712039425] [2020-10-16 01:31:25,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:25,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:25,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:25,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:25,226 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 194 [2020-10-16 01:31:25,227 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 295 flow. Second operand 5 states. [2020-10-16 01:31:25,227 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:25,227 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 194 [2020-10-16 01:31:25,228 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:25,429 INFO L129 PetriNetUnfolder]: 181/452 cut-off events. [2020-10-16 01:31:25,430 INFO L130 PetriNetUnfolder]: For 2156/2272 co-relation queries the response was YES. [2020-10-16 01:31:25,434 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 452 events. 181/452 cut-off events. For 2156/2272 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2795 event pairs, 40 based on Foata normal form. 14/436 useless extension candidates. Maximal degree in co-relation 1653. Up to 262 conditions per place. [2020-10-16 01:31:25,440 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 9 selfloop transitions, 11 changer transitions 1/49 dead transitions. [2020-10-16 01:31:25,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 345 flow [2020-10-16 01:31:25,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2020-10-16 01:31:25,444 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7912371134020618 [2020-10-16 01:31:25,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2020-10-16 01:31:25,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2020-10-16 01:31:25,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:25,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2020-10-16 01:31:25,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:25,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:25,450 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:25,450 INFO L185 Difference]: Start difference. First operand has 57 places, 47 transitions, 295 flow. Second operand 4 states and 614 transitions. [2020-10-16 01:31:25,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 345 flow [2020-10-16 01:31:25,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 334 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:25,457 INFO L241 Difference]: Finished difference. Result has 59 places, 46 transitions, 304 flow [2020-10-16 01:31:25,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2020-10-16 01:31:25,457 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2020-10-16 01:31:25,458 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 304 flow [2020-10-16 01:31:25,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:25,458 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:25,458 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:25,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:31:25,458 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 722333163, now seen corresponding path program 1 times [2020-10-16 01:31:25,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:25,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293007810] [2020-10-16 01:31:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:25,564 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 01:31:25,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293007810] [2020-10-16 01:31:25,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:25,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:25,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888795519] [2020-10-16 01:31:25,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:25,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:25,568 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 194 [2020-10-16 01:31:25,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 304 flow. Second operand 6 states. [2020-10-16 01:31:25,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:25,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 194 [2020-10-16 01:31:25,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:25,765 INFO L129 PetriNetUnfolder]: 223/580 cut-off events. [2020-10-16 01:31:25,765 INFO L130 PetriNetUnfolder]: For 2496/2579 co-relation queries the response was YES. [2020-10-16 01:31:25,769 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 580 events. 223/580 cut-off events. For 2496/2579 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3951 event pairs, 58 based on Foata normal form. 25/576 useless extension candidates. Maximal degree in co-relation 2056. Up to 293 conditions per place. [2020-10-16 01:31:25,774 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 11 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2020-10-16 01:31:25,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 398 flow [2020-10-16 01:31:25,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2020-10-16 01:31:25,778 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7690721649484537 [2020-10-16 01:31:25,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2020-10-16 01:31:25,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2020-10-16 01:31:25,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:25,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2020-10-16 01:31:25,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:25,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:25,783 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:25,784 INFO L185 Difference]: Start difference. First operand has 59 places, 46 transitions, 304 flow. Second operand 5 states and 746 transitions. [2020-10-16 01:31:25,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 398 flow [2020-10-16 01:31:25,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:25,791 INFO L241 Difference]: Finished difference. Result has 62 places, 52 transitions, 375 flow [2020-10-16 01:31:25,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2020-10-16 01:31:25,792 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2020-10-16 01:31:25,792 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 375 flow [2020-10-16 01:31:25,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:25,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:25,792 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:25,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:31:25,793 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1423863083, now seen corresponding path program 2 times [2020-10-16 01:31:25,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:25,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128401483] [2020-10-16 01:31:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:25,917 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 01:31:25,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128401483] [2020-10-16 01:31:25,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:25,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:25,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009582311] [2020-10-16 01:31:25,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:25,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:25,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:25,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:25,920 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 194 [2020-10-16 01:31:25,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 375 flow. Second operand 5 states. [2020-10-16 01:31:25,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:25,922 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 194 [2020-10-16 01:31:25,922 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:26,083 INFO L129 PetriNetUnfolder]: 207/560 cut-off events. [2020-10-16 01:31:26,083 INFO L130 PetriNetUnfolder]: For 2998/3071 co-relation queries the response was YES. [2020-10-16 01:31:26,087 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2215 conditions, 560 events. 207/560 cut-off events. For 2998/3071 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3858 event pairs, 58 based on Foata normal form. 23/556 useless extension candidates. Maximal degree in co-relation 2188. Up to 247 conditions per place. [2020-10-16 01:31:26,092 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 17 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2020-10-16 01:31:26,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 56 transitions, 448 flow [2020-10-16 01:31:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2020-10-16 01:31:26,095 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7835051546391752 [2020-10-16 01:31:26,095 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 608 transitions. [2020-10-16 01:31:26,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 608 transitions. [2020-10-16 01:31:26,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:26,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 608 transitions. [2020-10-16 01:31:26,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:26,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:26,100 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:26,101 INFO L185 Difference]: Start difference. First operand has 62 places, 52 transitions, 375 flow. Second operand 4 states and 608 transitions. [2020-10-16 01:31:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 56 transitions, 448 flow [2020-10-16 01:31:26,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 56 transitions, 443 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:26,111 INFO L241 Difference]: Finished difference. Result has 65 places, 53 transitions, 397 flow [2020-10-16 01:31:26,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2020-10-16 01:31:26,112 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2020-10-16 01:31:26,112 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 397 flow [2020-10-16 01:31:26,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:26,112 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:26,112 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:26,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:31:26,112 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:26,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:26,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1807747752, now seen corresponding path program 1 times [2020-10-16 01:31:26,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:26,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040468336] [2020-10-16 01:31:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:26,240 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 01:31:26,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040468336] [2020-10-16 01:31:26,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:26,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:26,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604603518] [2020-10-16 01:31:26,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:26,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:26,243 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2020-10-16 01:31:26,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 397 flow. Second operand 6 states. [2020-10-16 01:31:26,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:26,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2020-10-16 01:31:26,244 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:26,496 INFO L129 PetriNetUnfolder]: 200/559 cut-off events. [2020-10-16 01:31:26,497 INFO L130 PetriNetUnfolder]: For 3427/3529 co-relation queries the response was YES. [2020-10-16 01:31:26,502 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 559 events. 200/559 cut-off events. For 3427/3529 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3933 event pairs, 11 based on Foata normal form. 21/553 useless extension candidates. Maximal degree in co-relation 2560. Up to 241 conditions per place. [2020-10-16 01:31:26,507 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 13 selfloop transitions, 21 changer transitions 0/62 dead transitions. [2020-10-16 01:31:26,507 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 542 flow [2020-10-16 01:31:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2020-10-16 01:31:26,511 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7597938144329897 [2020-10-16 01:31:26,512 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2020-10-16 01:31:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2020-10-16 01:31:26,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:26,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2020-10-16 01:31:26,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:26,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:26,516 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:26,516 INFO L185 Difference]: Start difference. First operand has 65 places, 53 transitions, 397 flow. Second operand 5 states and 737 transitions. [2020-10-16 01:31:26,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 542 flow [2020-10-16 01:31:26,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 519 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:26,525 INFO L241 Difference]: Finished difference. Result has 67 places, 59 transitions, 499 flow [2020-10-16 01:31:26,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2020-10-16 01:31:26,525 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2020-10-16 01:31:26,526 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 499 flow [2020-10-16 01:31:26,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:26,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:26,526 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:26,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:31:26,526 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -68782584, now seen corresponding path program 1 times [2020-10-16 01:31:26,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:26,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653219271] [2020-10-16 01:31:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:26,595 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 01:31:26,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653219271] [2020-10-16 01:31:26,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:26,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:26,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434311318] [2020-10-16 01:31:26,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:26,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:26,598 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 194 [2020-10-16 01:31:26,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 499 flow. Second operand 6 states. [2020-10-16 01:31:26,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:26,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 194 [2020-10-16 01:31:26,599 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:26,897 INFO L129 PetriNetUnfolder]: 476/1330 cut-off events. [2020-10-16 01:31:26,897 INFO L130 PetriNetUnfolder]: For 9488/9659 co-relation queries the response was YES. [2020-10-16 01:31:26,909 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5468 conditions, 1330 events. 476/1330 cut-off events. For 9488/9659 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 12029 event pairs, 60 based on Foata normal form. 45/1330 useless extension candidates. Maximal degree in co-relation 5439. Up to 401 conditions per place. [2020-10-16 01:31:26,919 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 24 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2020-10-16 01:31:26,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 812 flow [2020-10-16 01:31:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:31:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:31:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 927 transitions. [2020-10-16 01:31:26,923 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7963917525773195 [2020-10-16 01:31:26,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 927 transitions. [2020-10-16 01:31:26,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 927 transitions. [2020-10-16 01:31:26,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:26,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 927 transitions. [2020-10-16 01:31:26,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:31:26,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:31:26,929 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:31:26,929 INFO L185 Difference]: Start difference. First operand has 67 places, 59 transitions, 499 flow. Second operand 6 states and 927 transitions. [2020-10-16 01:31:26,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 812 flow [2020-10-16 01:31:26,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 804 flow, removed 4 selfloop flow, removed 0 redundant places. [2020-10-16 01:31:26,943 INFO L241 Difference]: Finished difference. Result has 75 places, 69 transitions, 697 flow [2020-10-16 01:31:26,943 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=697, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2020-10-16 01:31:26,943 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2020-10-16 01:31:26,944 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 697 flow [2020-10-16 01:31:26,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:26,944 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:26,944 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 01:31:26,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:31:26,944 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:26,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1652923294, now seen corresponding path program 1 times [2020-10-16 01:31:26,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:26,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406138370] [2020-10-16 01:31:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,007 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 01:31:27,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406138370] [2020-10-16 01:31:27,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:31:27,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862049015] [2020-10-16 01:31:27,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:31:27,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:31:27,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:31:27,010 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2020-10-16 01:31:27,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 697 flow. Second operand 3 states. [2020-10-16 01:31:27,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2020-10-16 01:31:27,011 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:27,168 INFO L129 PetriNetUnfolder]: 223/838 cut-off events. [2020-10-16 01:31:27,169 INFO L130 PetriNetUnfolder]: For 6168/6356 co-relation queries the response was YES. [2020-10-16 01:31:27,175 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 838 events. 223/838 cut-off events. For 6168/6356 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7622 event pairs, 50 based on Foata normal form. 32/816 useless extension candidates. Maximal degree in co-relation 3586. Up to 253 conditions per place. [2020-10-16 01:31:27,180 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 4 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2020-10-16 01:31:27,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 69 transitions, 713 flow [2020-10-16 01:31:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:31:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:31:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2020-10-16 01:31:27,183 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2020-10-16 01:31:27,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2020-10-16 01:31:27,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2020-10-16 01:31:27,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:27,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2020-10-16 01:31:27,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:31:27,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:31:27,187 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:31:27,187 INFO L185 Difference]: Start difference. First operand has 75 places, 69 transitions, 697 flow. Second operand 3 states and 501 transitions. [2020-10-16 01:31:27,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 69 transitions, 713 flow [2020-10-16 01:31:27,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:31:27,202 INFO L241 Difference]: Finished difference. Result has 76 places, 69 transitions, 708 flow [2020-10-16 01:31:27,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2020-10-16 01:31:27,203 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2020-10-16 01:31:27,203 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 708 flow [2020-10-16 01:31:27,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:31:27,203 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,203 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:31:27,204 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1612252006, now seen corresponding path program 2 times [2020-10-16 01:31:27,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625798043] [2020-10-16 01:31:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:31:27,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625798043] [2020-10-16 01:31:27,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:27,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142859028] [2020-10-16 01:31:27,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:27,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:27,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:27,340 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 01:31:27,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 708 flow. Second operand 6 states. [2020-10-16 01:31:27,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 01:31:27,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:27,625 INFO L129 PetriNetUnfolder]: 299/1000 cut-off events. [2020-10-16 01:31:27,626 INFO L130 PetriNetUnfolder]: For 7988/8241 co-relation queries the response was YES. [2020-10-16 01:31:27,633 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4941 conditions, 1000 events. 299/1000 cut-off events. For 7988/8241 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 9119 event pairs, 48 based on Foata normal form. 30/985 useless extension candidates. Maximal degree in co-relation 4907. Up to 525 conditions per place. [2020-10-16 01:31:27,639 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 20 changer transitions 4/72 dead transitions. [2020-10-16 01:31:27,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 816 flow [2020-10-16 01:31:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2020-10-16 01:31:27,643 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7494845360824742 [2020-10-16 01:31:27,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2020-10-16 01:31:27,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2020-10-16 01:31:27,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:27,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2020-10-16 01:31:27,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:27,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:27,648 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:27,648 INFO L185 Difference]: Start difference. First operand has 76 places, 69 transitions, 708 flow. Second operand 5 states and 727 transitions. [2020-10-16 01:31:27,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 816 flow [2020-10-16 01:31:27,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 810 flow, removed 1 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:27,664 INFO L241 Difference]: Finished difference. Result has 80 places, 66 transitions, 686 flow [2020-10-16 01:31:27,664 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=686, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2020-10-16 01:31:27,665 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places. [2020-10-16 01:31:27,665 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 686 flow [2020-10-16 01:31:27,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:27,665 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:27,665 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:27,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:31:27,665 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1282096562, now seen corresponding path program 3 times [2020-10-16 01:31:27,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:27,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594223977] [2020-10-16 01:31:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:27,793 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 01:31:27,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594223977] [2020-10-16 01:31:27,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:27,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:27,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775585527] [2020-10-16 01:31:27,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:27,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:27,798 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 194 [2020-10-16 01:31:27,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 66 transitions, 686 flow. Second operand 7 states. [2020-10-16 01:31:27,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:27,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 194 [2020-10-16 01:31:27,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:28,078 INFO L129 PetriNetUnfolder]: 245/897 cut-off events. [2020-10-16 01:31:28,078 INFO L130 PetriNetUnfolder]: For 8160/8392 co-relation queries the response was YES. [2020-10-16 01:31:28,088 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 897 events. 245/897 cut-off events. For 8160/8392 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8160 event pairs, 48 based on Foata normal form. 29/897 useless extension candidates. Maximal degree in co-relation 4446. Up to 467 conditions per place. [2020-10-16 01:31:28,097 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 22 selfloop transitions, 19 changer transitions 2/72 dead transitions. [2020-10-16 01:31:28,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 72 transitions, 822 flow [2020-10-16 01:31:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2020-10-16 01:31:28,102 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7484536082474227 [2020-10-16 01:31:28,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2020-10-16 01:31:28,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2020-10-16 01:31:28,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:28,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2020-10-16 01:31:28,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:28,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:28,109 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:28,109 INFO L185 Difference]: Start difference. First operand has 80 places, 66 transitions, 686 flow. Second operand 5 states and 726 transitions. [2020-10-16 01:31:28,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 72 transitions, 822 flow [2020-10-16 01:31:28,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 72 transitions, 784 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:28,130 INFO L241 Difference]: Finished difference. Result has 82 places, 66 transitions, 692 flow [2020-10-16 01:31:28,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2020-10-16 01:31:28,130 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2020-10-16 01:31:28,131 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 692 flow [2020-10-16 01:31:28,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:28,131 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:28,131 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:31:28,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:31:28,132 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:28,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2127340712, now seen corresponding path program 1 times [2020-10-16 01:31:28,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:28,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073768273] [2020-10-16 01:31:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:28,210 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 01:31:28,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073768273] [2020-10-16 01:31:28,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:28,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:31:28,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563296647] [2020-10-16 01:31:28,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:31:28,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:31:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:31:28,214 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:28,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 692 flow. Second operand 4 states. [2020-10-16 01:31:28,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:28,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:28,216 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:29,173 INFO L129 PetriNetUnfolder]: 2629/4805 cut-off events. [2020-10-16 01:31:29,174 INFO L130 PetriNetUnfolder]: For 18141/19751 co-relation queries the response was YES. [2020-10-16 01:31:29,231 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 4805 events. 2629/4805 cut-off events. For 18141/19751 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 40849 event pairs, 317 based on Foata normal form. 567/4807 useless extension candidates. Maximal degree in co-relation 15287. Up to 2400 conditions per place. [2020-10-16 01:31:29,258 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 12 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2020-10-16 01:31:29,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 74 transitions, 728 flow [2020-10-16 01:31:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:31:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:31:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2020-10-16 01:31:29,263 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8324742268041238 [2020-10-16 01:31:29,264 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2020-10-16 01:31:29,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2020-10-16 01:31:29,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:29,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2020-10-16 01:31:29,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:31:29,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:31:29,270 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:31:29,270 INFO L185 Difference]: Start difference. First operand has 82 places, 66 transitions, 692 flow. Second operand 4 states and 646 transitions. [2020-10-16 01:31:29,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 74 transitions, 728 flow [2020-10-16 01:31:29,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 704 flow, removed 6 selfloop flow, removed 1 redundant places. [2020-10-16 01:31:29,305 INFO L241 Difference]: Finished difference. Result has 86 places, 69 transitions, 694 flow [2020-10-16 01:31:29,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=694, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2020-10-16 01:31:29,306 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2020-10-16 01:31:29,306 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 694 flow [2020-10-16 01:31:29,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:31:29,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:29,307 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 01:31:29,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:31:29,307 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -350364037, now seen corresponding path program 1 times [2020-10-16 01:31:29,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:29,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895354641] [2020-10-16 01:31:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:29,383 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 01:31:29,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895354641] [2020-10-16 01:31:29,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:29,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:29,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077206080] [2020-10-16 01:31:29,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:31:29,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:31:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:31:29,422 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:29,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 694 flow. Second operand 5 states. [2020-10-16 01:31:29,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:29,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:29,424 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:29,956 INFO L129 PetriNetUnfolder]: 1477/3015 cut-off events. [2020-10-16 01:31:29,957 INFO L130 PetriNetUnfolder]: For 11418/15784 co-relation queries the response was YES. [2020-10-16 01:31:29,988 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11722 conditions, 3015 events. 1477/3015 cut-off events. For 11418/15784 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 25606 event pairs, 53 based on Foata normal form. 554/3199 useless extension candidates. Maximal degree in co-relation 11682. Up to 2267 conditions per place. [2020-10-16 01:31:30,000 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 12 selfloop transitions, 10 changer transitions 2/75 dead transitions. [2020-10-16 01:31:30,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 75 transitions, 738 flow [2020-10-16 01:31:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:31:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:31:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2020-10-16 01:31:30,005 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2020-10-16 01:31:30,005 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:30,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2020-10-16 01:31:30,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:31:30,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:31:30,010 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:31:30,010 INFO L185 Difference]: Start difference. First operand has 86 places, 69 transitions, 694 flow. Second operand 5 states and 808 transitions. [2020-10-16 01:31:30,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 75 transitions, 738 flow [2020-10-16 01:31:30,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 75 transitions, 711 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 01:31:30,026 INFO L241 Difference]: Finished difference. Result has 88 places, 69 transitions, 678 flow [2020-10-16 01:31:30,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=678, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2020-10-16 01:31:30,027 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2020-10-16 01:31:30,027 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 678 flow [2020-10-16 01:31:30,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:31:30,027 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:30,027 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 01:31:30,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:31:30,028 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 51520265, now seen corresponding path program 1 times [2020-10-16 01:31:30,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:30,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719439480] [2020-10-16 01:31:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:30,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 01:31:30,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719439480] [2020-10-16 01:31:30,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:30,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:30,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329568508] [2020-10-16 01:31:30,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:30,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:30,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:30,101 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:30,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 678 flow. Second operand 6 states. [2020-10-16 01:31:30,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:30,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:30,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:30,510 INFO L129 PetriNetUnfolder]: 1080/2384 cut-off events. [2020-10-16 01:31:30,510 INFO L130 PetriNetUnfolder]: For 10196/16447 co-relation queries the response was YES. [2020-10-16 01:31:30,531 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11247 conditions, 2384 events. 1080/2384 cut-off events. For 10196/16447 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 20614 event pairs, 5 based on Foata normal form. 553/2590 useless extension candidates. Maximal degree in co-relation 11207. Up to 1873 conditions per place. [2020-10-16 01:31:30,539 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 13 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2020-10-16 01:31:30,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 76 transitions, 765 flow [2020-10-16 01:31:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:31:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:31:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2020-10-16 01:31:30,544 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2020-10-16 01:31:30,544 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2020-10-16 01:31:30,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2020-10-16 01:31:30,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:30,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2020-10-16 01:31:30,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:31:30,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:31:30,550 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:31:30,550 INFO L185 Difference]: Start difference. First operand has 88 places, 69 transitions, 678 flow. Second operand 6 states and 970 transitions. [2020-10-16 01:31:30,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 76 transitions, 765 flow [2020-10-16 01:31:30,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 76 transitions, 743 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:30,568 INFO L241 Difference]: Finished difference. Result has 92 places, 72 transitions, 724 flow [2020-10-16 01:31:30,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2020-10-16 01:31:30,568 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 52 predicate places. [2020-10-16 01:31:30,568 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 724 flow [2020-10-16 01:31:30,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:30,569 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:30,569 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] [2020-10-16 01:31:30,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 01:31:30,569 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1245337081, now seen corresponding path program 1 times [2020-10-16 01:31:30,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:30,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500499856] [2020-10-16 01:31:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:30,716 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 01:31:30,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500499856] [2020-10-16 01:31:30,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:30,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:31:30,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125764180] [2020-10-16 01:31:30,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:30,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:30,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:30,721 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 194 [2020-10-16 01:31:30,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 724 flow. Second operand 7 states. [2020-10-16 01:31:30,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:30,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 194 [2020-10-16 01:31:30,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:31,227 INFO L129 PetriNetUnfolder]: 1445/3073 cut-off events. [2020-10-16 01:31:31,228 INFO L130 PetriNetUnfolder]: For 17078/20093 co-relation queries the response was YES. [2020-10-16 01:31:31,250 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14756 conditions, 3073 events. 1445/3073 cut-off events. For 17078/20093 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 27502 event pairs, 26 based on Foata normal form. 154/2776 useless extension candidates. Maximal degree in co-relation 14714. Up to 2340 conditions per place. [2020-10-16 01:31:31,257 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 9 selfloop transitions, 16 changer transitions 8/74 dead transitions. [2020-10-16 01:31:31,258 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 74 transitions, 822 flow [2020-10-16 01:31:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:31:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:31:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 849 transitions. [2020-10-16 01:31:31,262 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.729381443298969 [2020-10-16 01:31:31,262 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 849 transitions. [2020-10-16 01:31:31,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 849 transitions. [2020-10-16 01:31:31,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:31,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 849 transitions. [2020-10-16 01:31:31,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:31:31,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:31:31,267 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:31:31,267 INFO L185 Difference]: Start difference. First operand has 92 places, 72 transitions, 724 flow. Second operand 6 states and 849 transitions. [2020-10-16 01:31:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 74 transitions, 822 flow [2020-10-16 01:31:31,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 74 transitions, 791 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:31:31,341 INFO L241 Difference]: Finished difference. Result has 95 places, 65 transitions, 637 flow [2020-10-16 01:31:31,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=95, PETRI_TRANSITIONS=65} [2020-10-16 01:31:31,342 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 55 predicate places. [2020-10-16 01:31:31,342 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 65 transitions, 637 flow [2020-10-16 01:31:31,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:31,342 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:31,342 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] [2020-10-16 01:31:31,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 01:31:31,343 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1217130753, now seen corresponding path program 1 times [2020-10-16 01:31:31,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:31,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694277183] [2020-10-16 01:31:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:31,424 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 01:31:31,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694277183] [2020-10-16 01:31:31,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:31,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:31:31,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471723115] [2020-10-16 01:31:31,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:31:31,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:31:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:31:31,427 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 194 [2020-10-16 01:31:31,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 65 transitions, 637 flow. Second operand 6 states. [2020-10-16 01:31:31,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:31,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 194 [2020-10-16 01:31:31,428 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:32,179 INFO L129 PetriNetUnfolder]: 1700/3722 cut-off events. [2020-10-16 01:31:32,179 INFO L130 PetriNetUnfolder]: For 15069/16947 co-relation queries the response was YES. [2020-10-16 01:31:32,209 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15102 conditions, 3722 events. 1700/3722 cut-off events. For 15069/16947 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 35878 event pairs, 24 based on Foata normal form. 223/3342 useless extension candidates. Maximal degree in co-relation 15059. Up to 1599 conditions per place. [2020-10-16 01:31:32,218 INFO L132 encePairwiseOnDemand]: 189/194 looper letters, 38 selfloop transitions, 11 changer transitions 1/92 dead transitions. [2020-10-16 01:31:32,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 1080 flow [2020-10-16 01:31:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:31:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:31:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1036 transitions. [2020-10-16 01:31:32,222 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7628865979381443 [2020-10-16 01:31:32,223 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1036 transitions. [2020-10-16 01:31:32,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1036 transitions. [2020-10-16 01:31:32,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:32,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1036 transitions. [2020-10-16 01:31:32,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:31:32,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:31:32,228 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:31:32,229 INFO L185 Difference]: Start difference. First operand has 95 places, 65 transitions, 637 flow. Second operand 7 states and 1036 transitions. [2020-10-16 01:31:32,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 1080 flow [2020-10-16 01:31:32,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 1010 flow, removed 10 selfloop flow, removed 7 redundant places. [2020-10-16 01:31:32,311 INFO L241 Difference]: Finished difference. Result has 94 places, 67 transitions, 635 flow [2020-10-16 01:31:32,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=635, PETRI_PLACES=94, PETRI_TRANSITIONS=67} [2020-10-16 01:31:32,311 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2020-10-16 01:31:32,311 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 67 transitions, 635 flow [2020-10-16 01:31:32,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:31:32,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:32,312 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] [2020-10-16 01:31:32,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 01:31:32,312 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1938343285, now seen corresponding path program 1 times [2020-10-16 01:31:32,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:32,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515497543] [2020-10-16 01:31:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:31:32,427 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 01:31:32,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515497543] [2020-10-16 01:31:32,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:31:32,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:31:32,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044263184] [2020-10-16 01:31:32,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:31:32,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:31:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:31:32,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:31:32,430 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 194 [2020-10-16 01:31:32,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 67 transitions, 635 flow. Second operand 7 states. [2020-10-16 01:31:32,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:31:32,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 194 [2020-10-16 01:31:32,431 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:31:32,809 INFO L129 PetriNetUnfolder]: 1418/2946 cut-off events. [2020-10-16 01:31:32,809 INFO L130 PetriNetUnfolder]: For 11734/19348 co-relation queries the response was YES. [2020-10-16 01:31:32,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 13626 conditions, 2946 events. 1418/2946 cut-off events. For 11734/19348 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 26054 event pairs, 0 based on Foata normal form. 501/2975 useless extension candidates. Maximal degree in co-relation 13584. Up to 1405 conditions per place. [2020-10-16 01:31:32,831 INFO L132 encePairwiseOnDemand]: 187/194 looper letters, 5 selfloop transitions, 18 changer transitions 22/68 dead transitions. [2020-10-16 01:31:32,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 68 transitions, 689 flow [2020-10-16 01:31:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:31:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:31:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2020-10-16 01:31:32,836 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8276877761413843 [2020-10-16 01:31:32,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2020-10-16 01:31:32,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2020-10-16 01:31:32,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:31:32,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2020-10-16 01:31:32,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:31:32,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:31:32,841 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:31:32,841 INFO L185 Difference]: Start difference. First operand has 94 places, 67 transitions, 635 flow. Second operand 7 states and 1124 transitions. [2020-10-16 01:31:32,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 68 transitions, 689 flow [2020-10-16 01:31:32,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 68 transitions, 638 flow, removed 19 selfloop flow, removed 4 redundant places. [2020-10-16 01:31:32,898 INFO L241 Difference]: Finished difference. Result has 98 places, 46 transitions, 406 flow [2020-10-16 01:31:32,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=98, PETRI_TRANSITIONS=46} [2020-10-16 01:31:32,899 INFO L342 CegarLoopForPetriNet]: 40 programPoint places, 58 predicate places. [2020-10-16 01:31:32,899 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 46 transitions, 406 flow [2020-10-16 01:31:32,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:31:32,899 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:31:32,899 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] [2020-10-16 01:31:32,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 01:31:32,900 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:31:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:31:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash 299132041, now seen corresponding path program 1 times [2020-10-16 01:31:32,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:31:32,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730997094] [2020-10-16 01:31:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:31:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:31:32,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:31:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:31:32,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:31:32,996 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:31:32,996 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:31:32,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 01:31:32,997 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:31:33,010 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L3-->L841: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In-914929540 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In-914929540 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-914929540 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-914929540 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~z~0_Out-914929540 ~z$w_buff0~0_In-914929540)) (and .cse2 (or (and .cse3 .cse4 (= ~z$w_buff1~0_In-914929540 ~z~0_Out-914929540)) (and .cse5 (= ~z~0_In-914929540 ~z~0_Out-914929540))))) (= ~z$r_buff0_thd0~0_Out-914929540 ~z$r_buff0_thd0~0_In-914929540) (= ~z$r_buff1_thd0~0_Out-914929540 ~z$r_buff1_thd0~0_In-914929540) (or (and .cse0 (= ~z$w_buff0_used~0_Out-914929540 0) .cse1) (and (= ~z$w_buff0_used~0_In-914929540 ~z$w_buff0_used~0_Out-914929540) .cse2)) (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_In-914929540)) (or (and .cse3 (= ~z$w_buff1_used~0_Out-914929540 0) .cse4) (and .cse5 (= ~z$w_buff1_used~0_Out-914929540 ~z$w_buff1_used~0_In-914929540)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-914929540, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-914929540, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-914929540, ~z$w_buff0~0=~z$w_buff0~0_In-914929540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-914929540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-914929540, ~z$w_buff1~0=~z$w_buff1~0_In-914929540, ~z~0=~z~0_In-914929540} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-914929540, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-914929540|, ~z$w_buff0~0=~z$w_buff0~0_In-914929540, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-914929540|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-914929540, ~z$w_buff1~0=~z$w_buff1~0_In-914929540, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-914929540|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-914929540|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-914929540|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-914929540|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-914929540, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-914929540, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-914929540, ~z~0=~z~0_Out-914929540} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 01:31:33,017 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 01:31:33,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,019 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 01:31:33,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,020 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 01:31:33,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,020 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 01:31:33,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,020 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 01:31:33,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,021 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 01:31:33,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,021 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 01:31:33,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,021 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 01:31:33,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,022 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 01:31:33,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,022 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 01:31:33,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,022 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 01:31:33,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,023 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 01:31:33,023 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,024 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 01:31:33,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,025 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 01:31:33,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,025 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 01:31:33,025 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,025 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 01:31:33,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,026 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 01:31:33,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,026 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 01:31:33,026 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,026 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 01:31:33,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,027 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 01:31:33,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,027 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 01:31:33,027 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,028 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 01:31:33,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,028 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 01:31:33,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,028 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 01:31:33,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,028 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 01:31:33,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:31:33,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:31:33 BasicIcfg [2020-10-16 01:31:33,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:31:33,102 INFO L168 Benchmark]: Toolchain (without parser) took 24652.58 ms. Allocated memory was 254.8 MB in the beginning and 736.1 MB in the end (delta: 481.3 MB). Free memory was 209.9 MB in the beginning and 364.3 MB in the end (delta: -154.4 MB). Peak memory consumption was 326.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,102 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:31:33,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 881.93 ms. Allocated memory was 254.8 MB in the beginning and 327.7 MB in the end (delta: 72.9 MB). Free memory was 209.9 MB in the beginning and 273.5 MB in the end (delta: -63.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 327.7 MB. Free memory was 273.5 MB in the beginning and 270.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,104 INFO L168 Benchmark]: Boogie Preprocessor took 44.86 ms. Allocated memory is still 327.7 MB. Free memory was 270.9 MB in the beginning and 268.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,105 INFO L168 Benchmark]: RCFGBuilder took 2168.73 ms. Allocated memory was 327.7 MB in the beginning and 362.3 MB in the end (delta: 34.6 MB). Free memory was 268.4 MB in the beginning and 208.3 MB in the end (delta: 60.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,106 INFO L168 Benchmark]: TraceAbstraction took 21472.09 ms. Allocated memory was 362.3 MB in the beginning and 736.1 MB in the end (delta: 373.8 MB). Free memory was 208.3 MB in the beginning and 364.3 MB in the end (delta: -156.0 MB). Peak memory consumption was 217.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:31:33,109 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.39 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 881.93 ms. Allocated memory was 254.8 MB in the beginning and 327.7 MB in the end (delta: 72.9 MB). Free memory was 209.9 MB in the beginning and 273.5 MB in the end (delta: -63.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 327.7 MB. Free memory was 273.5 MB in the beginning and 270.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.86 ms. Allocated memory is still 327.7 MB. Free memory was 270.9 MB in the beginning and 268.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2168.73 ms. Allocated memory was 327.7 MB in the beginning and 362.3 MB in the end (delta: 34.6 MB). Free memory was 268.4 MB in the beginning and 208.3 MB in the end (delta: 60.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 21472.09 ms. Allocated memory was 362.3 MB in the beginning and 736.1 MB in the end (delta: 373.8 MB). Free memory was 208.3 MB in the beginning and 364.3 MB in the end (delta: -156.0 MB). Peak memory consumption was 217.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1653 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 41 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.5s, 114 PlacesBefore, 40 PlacesAfterwards, 103 TransitionsBefore, 28 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 6523 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 a = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L709] 0 int y = 0; [L711] 0 int z = 0; [L712] 0 _Bool z$flush_delayed; [L713] 0 int z$mem_tmp; [L714] 0 _Bool z$r_buff0_thd0; [L715] 0 _Bool z$r_buff0_thd1; [L716] 0 _Bool z$r_buff0_thd2; [L717] 0 _Bool z$r_buff0_thd3; [L718] 0 _Bool z$r_buff0_thd4; [L719] 0 _Bool z$r_buff1_thd0; [L720] 0 _Bool z$r_buff1_thd1; [L721] 0 _Bool z$r_buff1_thd2; [L722] 0 _Bool z$r_buff1_thd3; [L723] 0 _Bool z$r_buff1_thd4; [L724] 0 _Bool z$read_delayed; [L725] 0 int *z$read_delayed_var; [L726] 0 int z$w_buff0; [L727] 0 _Bool z$w_buff0_used; [L728] 0 int z$w_buff1; [L729] 0 _Bool z$w_buff1_used; [L730] 0 _Bool weak$$choice0; [L731] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1533; [L824] FCALL, FORK 0 pthread_create(&t1533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 pthread_t t1534; [L826] FCALL, FORK 0 pthread_create(&t1534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1535; [L828] FCALL, FORK 0 pthread_create(&t1535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1536; [L830] FCALL, FORK 0 pthread_create(&t1536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 4 z$w_buff1 = z$w_buff0 [L786] 4 z$w_buff0 = 2 [L787] 4 z$w_buff1_used = z$w_buff0_used [L788] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L790] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L791] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L792] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L793] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L794] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L795] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L772] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L774] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L775] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L801] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L801] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L802] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L803] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L778] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 3 return 0; [L808] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 4 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 z$flush_delayed = weak$$choice2 [L846] 0 z$mem_tmp = z [L847] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L848] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L849] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L852] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L853] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L855] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L855] 0 z = z$flush_delayed ? z$mem_tmp : z [L856] 0 z$flush_delayed = (_Bool)0 [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=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 94 SDtfs, 66 SDslu, 36 SDs, 0 SdLazy, 501 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=20, 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.6s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 38151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...