/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:44:41,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:44:41,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:44:41,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:44:41,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:44:41,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:44:41,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:44:41,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:44:41,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:44:41,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:44:41,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:44:41,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:44:41,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:44:41,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:44:41,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:44:41,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:44:41,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:44:41,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:44:41,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:44:41,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:44:41,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:44:41,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:44:41,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:44:41,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:44:41,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:44:41,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:44:41,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:44:41,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:44:41,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:44:41,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:44:41,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:44:41,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:44:41,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:44:41,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:44:41,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:44:41,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:44:41,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:44:41,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:44:41,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:44:41,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:44:41,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:44:41,142 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:44:41,166 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:44:41,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:44:41,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:44:41,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:44:41,168 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:44:41,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:44:41,169 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:44:41,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:44:41,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:44:41,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:44:41,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:44:41,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:44:41,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:44:41,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:44:41,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:44:41,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:44:41,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:44:41,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:44:41,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:44:41,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:44:41,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:44:41,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:44:41,173 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:44:41,173 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:44:41,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:44:41,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:44:41,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:44:41,491 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:44:41,492 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:44:41,493 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-16 01:44:41,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d17446a/da77a2255b63414fae83e81f5505b609/FLAG2060c8330 [2020-10-16 01:44:42,069 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:44:42,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-16 01:44:42,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d17446a/da77a2255b63414fae83e81f5505b609/FLAG2060c8330 [2020-10-16 01:44:42,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d17446a/da77a2255b63414fae83e81f5505b609 [2020-10-16 01:44:42,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:44:42,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:44:42,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:44:42,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:44:42,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:44:42,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:42" (1/1) ... [2020-10-16 01:44:42,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b313127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:42, skipping insertion in model container [2020-10-16 01:44:42,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:44:42" (1/1) ... [2020-10-16 01:44:42,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:44:42,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:44:42,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:44:42,954 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:44:43,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:44:43,136 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:44:43,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43 WrapperNode [2020-10-16 01:44:43,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:44:43,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:44:43,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:44:43,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:44:43,148 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:44:43" (1/1) ... [2020-10-16 01:44:43,168 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:44:43" (1/1) ... [2020-10-16 01:44:43,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:44:43,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:44:43,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:44:43,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:44:43,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (1/1) ... [2020-10-16 01:44:43,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:44:43,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:44:43,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:44:43,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:44:43,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (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:44:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:44:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:44:43,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:44:43,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:44:43,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:44:43,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:44:43,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:44:43,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:44:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:44:43,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:44:43,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:44:43,395 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:44:45,480 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:44:45,481 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:44:45,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:45 BoogieIcfgContainer [2020-10-16 01:44:45,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:44:45,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:44:45,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:44:45,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:44:45,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:44:42" (1/3) ... [2020-10-16 01:44:45,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53981263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:45, skipping insertion in model container [2020-10-16 01:44:45,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:44:43" (2/3) ... [2020-10-16 01:44:45,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53981263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:44:45, skipping insertion in model container [2020-10-16 01:44:45,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:44:45" (3/3) ... [2020-10-16 01:44:45,493 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-16 01:44:45,505 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:44:45,513 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:44:45,514 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:44:45,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,555 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,564 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:44:45,583 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:44:45,605 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:44:45,605 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:44:45,605 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:44:45,606 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:44:45,606 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:44:45,606 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:44:45,606 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:44:45,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:44:45,620 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 01:44:45,659 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 01:44:45,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:45,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:44:45,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 01:44:45,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:45,674 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:44:45,676 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:45,679 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:45,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 72 transitions, 150 flow [2020-10-16 01:44:45,699 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 01:44:45,699 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:45,700 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 01:44:45,702 INFO L117 LiptonReduction]: Number of co-enabled transitions 888 [2020-10-16 01:44:45,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:45,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:45,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:45,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:45,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:45,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:45,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:45,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:46,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:46,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:46,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:46,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 01:44:46,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:46,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:46,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:46,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:46,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:46,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-10-16 01:44:46,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 01:44:46,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:44:46,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:46,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:46,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,192 WARN L193 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:44:47,309 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:44:47,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:44:47,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:47,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:47,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:44:47,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:47,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:47,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:47,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:47,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:47,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:47,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:44:47,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:47,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:47,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,117 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 01:44:49,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:44:49,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 01:44:49,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:49,974 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 01:44:50,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:50,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:50,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:50,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:50,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:50,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:50,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:50,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:50,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:50,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:51,541 WARN L193 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2020-10-16 01:44:51,830 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-10-16 01:44:52,424 WARN L193 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-16 01:44:52,702 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-16 01:44:52,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:52,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:52,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:52,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:52,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:52,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:52,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:44:52,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:52,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:52,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:44:53,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 3, 5, 3, 2, 1] term [2020-10-16 01:44:53,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:53,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 2, 1] term [2020-10-16 01:44:53,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 5, 2, 2, 1] term [2020-10-16 01:44:53,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-10-16 01:44:53,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 2, 1] term [2020-10-16 01:44:53,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 3, 5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 2, 2, 1] term [2020-10-16 01:44:53,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:44:53,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:44:53,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:44:53,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:44:53,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:44:53,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:44:53,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 01:44:53,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:44:53,825 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 01:44:54,168 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 01:44:54,626 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 01:44:54,722 INFO L132 LiptonReduction]: Checked pairs total: 2287 [2020-10-16 01:44:54,723 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 01:44:54,726 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9055 [2020-10-16 01:44:54,731 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:44:54,731 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:54,732 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:54,733 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:44:54,733 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 860640783, now seen corresponding path program 1 times [2020-10-16 01:44:54,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:54,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562375680] [2020-10-16 01:44:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:54,955 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:44:54,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562375680] [2020-10-16 01:44:54,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:54,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:44:54,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054530114] [2020-10-16 01:44:54,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:54,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:54,986 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2020-10-16 01:44:54,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states. [2020-10-16 01:44:54,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:54,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2020-10-16 01:44:54,990 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:55,062 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 01:44:55,062 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:55,063 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 195 event pairs, 9 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 01:44:55,065 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 01:44:55,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 01:44:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2020-10-16 01:44:55,082 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8119047619047619 [2020-10-16 01:44:55,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2020-10-16 01:44:55,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2020-10-16 01:44:55,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:55,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2020-10-16 01:44:55,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:55,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:55,100 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:55,103 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 42 flow. Second operand 3 states and 341 transitions. [2020-10-16 01:44:55,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 01:44:55,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:55,108 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 01:44:55,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 01:44:55,112 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:44:55,112 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 01:44:55,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:55,113 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:55,113 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:55,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:44:55,113 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1852838512, now seen corresponding path program 1 times [2020-10-16 01:44:55,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:55,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743500178] [2020-10-16 01:44:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:55,275 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:44:55,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743500178] [2020-10-16 01:44:55,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:55,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:44:55,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709535525] [2020-10-16 01:44:55,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:55,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:55,281 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 140 [2020-10-16 01:44:55,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 01:44:55,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:55,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 140 [2020-10-16 01:44:55,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:55,310 INFO L129 PetriNetUnfolder]: 3/25 cut-off events. [2020-10-16 01:44:55,310 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:44:55,311 INFO L80 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 25 events. 3/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 35. Up to 10 conditions per place. [2020-10-16 01:44:55,311 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 3 selfloop transitions, 3 changer transitions 0/17 dead transitions. [2020-10-16 01:44:55,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 17 transitions, 54 flow [2020-10-16 01:44:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2020-10-16 01:44:55,320 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2020-10-16 01:44:55,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2020-10-16 01:44:55,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2020-10-16 01:44:55,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:55,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2020-10-16 01:44:55,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:55,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:55,326 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:55,327 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 355 transitions. [2020-10-16 01:44:55,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 17 transitions, 54 flow [2020-10-16 01:44:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 17 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:55,329 INFO L241 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2020-10-16 01:44:55,329 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2020-10-16 01:44:55,330 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 01:44:55,330 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2020-10-16 01:44:55,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:55,330 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:55,330 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:55,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:44:55,331 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1603419562, now seen corresponding path program 1 times [2020-10-16 01:44:55,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:55,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735039250] [2020-10-16 01:44:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:55,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735039250] [2020-10-16 01:44:55,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:55,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:44:55,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296118466] [2020-10-16 01:44:55,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:44:55,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:55,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:44:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:44:55,526 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 01:44:55,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states. [2020-10-16 01:44:55,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:55,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 01:44:55,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:55,589 INFO L129 PetriNetUnfolder]: 35/87 cut-off events. [2020-10-16 01:44:55,589 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:44:55,590 INFO L80 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 87 events. 35/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 296 event pairs, 24 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 176. Up to 61 conditions per place. [2020-10-16 01:44:55,591 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 6 selfloop transitions, 6 changer transitions 0/22 dead transitions. [2020-10-16 01:44:55,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 87 flow [2020-10-16 01:44:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 413 transitions. [2020-10-16 01:44:55,595 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7375 [2020-10-16 01:44:55,595 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 413 transitions. [2020-10-16 01:44:55,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 413 transitions. [2020-10-16 01:44:55,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:55,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 413 transitions. [2020-10-16 01:44:55,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:55,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:55,599 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:55,599 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 413 transitions. [2020-10-16 01:44:55,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 87 flow [2020-10-16 01:44:55,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:55,600 INFO L241 Difference]: Finished difference. Result has 27 places, 22 transitions, 87 flow [2020-10-16 01:44:55,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2020-10-16 01:44:55,601 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2020-10-16 01:44:55,601 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 87 flow [2020-10-16 01:44:55,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:44:55,601 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:55,601 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:55,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:44:55,602 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:55,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1832301692, now seen corresponding path program 1 times [2020-10-16 01:44:55,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:55,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942430360] [2020-10-16 01:44:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:55,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942430360] [2020-10-16 01:44:55,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:55,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:55,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037468139] [2020-10-16 01:44:55,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:55,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:55,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:55,727 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2020-10-16 01:44:55,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 87 flow. Second operand 5 states. [2020-10-16 01:44:55,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:55,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2020-10-16 01:44:55,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:55,789 INFO L129 PetriNetUnfolder]: 32/78 cut-off events. [2020-10-16 01:44:55,789 INFO L130 PetriNetUnfolder]: For 37/47 co-relation queries the response was YES. [2020-10-16 01:44:55,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 78 events. 32/78 cut-off events. For 37/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 11 based on Foata normal form. 7/80 useless extension candidates. Maximal degree in co-relation 198. Up to 50 conditions per place. [2020-10-16 01:44:55,791 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 8 selfloop transitions, 9 changer transitions 0/27 dead transitions. [2020-10-16 01:44:55,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 137 flow [2020-10-16 01:44:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2020-10-16 01:44:55,794 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7482142857142857 [2020-10-16 01:44:55,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2020-10-16 01:44:55,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2020-10-16 01:44:55,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:55,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2020-10-16 01:44:55,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:55,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:55,797 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:55,797 INFO L185 Difference]: Start difference. First operand has 27 places, 22 transitions, 87 flow. Second operand 4 states and 419 transitions. [2020-10-16 01:44:55,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 137 flow [2020-10-16 01:44:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:44:55,800 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 136 flow [2020-10-16 01:44:55,800 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2020-10-16 01:44:55,800 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2020-10-16 01:44:55,801 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 136 flow [2020-10-16 01:44:55,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:55,801 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:55,801 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:55,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:44:55,801 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1806234195, now seen corresponding path program 1 times [2020-10-16 01:44:55,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:55,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598972775] [2020-10-16 01:44:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:55,892 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:44:55,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598972775] [2020-10-16 01:44:55,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:55,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:55,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480528736] [2020-10-16 01:44:55,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:55,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:55,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:55,895 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 140 [2020-10-16 01:44:55,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 136 flow. Second operand 5 states. [2020-10-16 01:44:55,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:55,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 140 [2020-10-16 01:44:55,896 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:56,012 INFO L129 PetriNetUnfolder]: 27/72 cut-off events. [2020-10-16 01:44:56,013 INFO L130 PetriNetUnfolder]: For 91/104 co-relation queries the response was YES. [2020-10-16 01:44:56,014 INFO L80 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 72 events. 27/72 cut-off events. For 91/104 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 226 event pairs, 7 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 232. Up to 48 conditions per place. [2020-10-16 01:44:56,015 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 11 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2020-10-16 01:44:56,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 184 flow [2020-10-16 01:44:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:44:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:44:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2020-10-16 01:44:56,019 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2020-10-16 01:44:56,019 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2020-10-16 01:44:56,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2020-10-16 01:44:56,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:56,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2020-10-16 01:44:56,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:44:56,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:44:56,022 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:44:56,022 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 136 flow. Second operand 4 states and 390 transitions. [2020-10-16 01:44:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 184 flow [2020-10-16 01:44:56,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 170 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:56,028 INFO L241 Difference]: Finished difference. Result has 34 places, 27 transitions, 152 flow [2020-10-16 01:44:56,029 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2020-10-16 01:44:56,029 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2020-10-16 01:44:56,029 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 152 flow [2020-10-16 01:44:56,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:56,029 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:56,029 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:56,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:44:56,030 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1712464671, now seen corresponding path program 1 times [2020-10-16 01:44:56,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:56,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081577601] [2020-10-16 01:44:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:56,196 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:44:56,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081577601] [2020-10-16 01:44:56,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:56,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:44:56,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340901446] [2020-10-16 01:44:56,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:44:56,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:44:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:44:56,200 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 140 [2020-10-16 01:44:56,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 152 flow. Second operand 6 states. [2020-10-16 01:44:56,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:56,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 140 [2020-10-16 01:44:56,202 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:56,347 INFO L129 PetriNetUnfolder]: 36/87 cut-off events. [2020-10-16 01:44:56,347 INFO L130 PetriNetUnfolder]: For 148/161 co-relation queries the response was YES. [2020-10-16 01:44:56,350 INFO L80 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 87 events. 36/87 cut-off events. For 148/161 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 291 event pairs, 7 based on Foata normal form. 8/92 useless extension candidates. Maximal degree in co-relation 302. Up to 57 conditions per place. [2020-10-16 01:44:56,386 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 10 selfloop transitions, 14 changer transitions 0/34 dead transitions. [2020-10-16 01:44:56,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 238 flow [2020-10-16 01:44:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2020-10-16 01:44:56,392 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7157142857142857 [2020-10-16 01:44:56,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2020-10-16 01:44:56,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2020-10-16 01:44:56,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:56,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2020-10-16 01:44:56,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:56,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:56,398 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:56,399 INFO L185 Difference]: Start difference. First operand has 34 places, 27 transitions, 152 flow. Second operand 5 states and 501 transitions. [2020-10-16 01:44:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 238 flow [2020-10-16 01:44:56,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 226 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:44:56,410 INFO L241 Difference]: Finished difference. Result has 38 places, 33 transitions, 224 flow [2020-10-16 01:44:56,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2020-10-16 01:44:56,411 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 14 predicate places. [2020-10-16 01:44:56,411 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 224 flow [2020-10-16 01:44:56,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:44:56,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:56,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:56,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:44:56,413 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 471463509, now seen corresponding path program 2 times [2020-10-16 01:44:56,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:56,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599457587] [2020-10-16 01:44:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:56,522 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:44:56,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599457587] [2020-10-16 01:44:56,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:56,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:56,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897562467] [2020-10-16 01:44:56,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:56,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:56,526 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 140 [2020-10-16 01:44:56,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 224 flow. Second operand 5 states. [2020-10-16 01:44:56,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:56,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 140 [2020-10-16 01:44:56,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:56,634 INFO L129 PetriNetUnfolder]: 34/88 cut-off events. [2020-10-16 01:44:56,634 INFO L130 PetriNetUnfolder]: For 283/304 co-relation queries the response was YES. [2020-10-16 01:44:56,635 INFO L80 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 88 events. 34/88 cut-off events. For 283/304 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 5 based on Foata normal form. 11/98 useless extension candidates. Maximal degree in co-relation 367. Up to 50 conditions per place. [2020-10-16 01:44:56,638 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 10 selfloop transitions, 17 changer transitions 0/37 dead transitions. [2020-10-16 01:44:56,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 301 flow [2020-10-16 01:44:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:44:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:44:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2020-10-16 01:44:56,642 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2020-10-16 01:44:56,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2020-10-16 01:44:56,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2020-10-16 01:44:56,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:56,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2020-10-16 01:44:56,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:44:56,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:44:56,646 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:44:56,646 INFO L185 Difference]: Start difference. First operand has 38 places, 33 transitions, 224 flow. Second operand 6 states and 605 transitions. [2020-10-16 01:44:56,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 301 flow [2020-10-16 01:44:56,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 292 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:56,651 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 273 flow [2020-10-16 01:44:56,651 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2020-10-16 01:44:56,652 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2020-10-16 01:44:56,652 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 273 flow [2020-10-16 01:44:56,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:56,652 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:56,652 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:56,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:44:56,653 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash 966777779, now seen corresponding path program 3 times [2020-10-16 01:44:56,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:56,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586439832] [2020-10-16 01:44:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:56,847 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:44:56,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586439832] [2020-10-16 01:44:56,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:56,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:44:56,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117739230] [2020-10-16 01:44:56,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:44:56,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:56,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:44:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:44:56,851 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 140 [2020-10-16 01:44:56,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 273 flow. Second operand 6 states. [2020-10-16 01:44:56,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:56,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 140 [2020-10-16 01:44:56,852 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:56,980 INFO L129 PetriNetUnfolder]: 31/89 cut-off events. [2020-10-16 01:44:56,980 INFO L130 PetriNetUnfolder]: For 395/410 co-relation queries the response was YES. [2020-10-16 01:44:56,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 89 events. 31/89 cut-off events. For 395/410 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 334 event pairs, 1 based on Foata normal form. 11/98 useless extension candidates. Maximal degree in co-relation 402. Up to 43 conditions per place. [2020-10-16 01:44:56,982 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 14 selfloop transitions, 19 changer transitions 0/43 dead transitions. [2020-10-16 01:44:56,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 405 flow [2020-10-16 01:44:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2020-10-16 01:44:56,985 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6957142857142857 [2020-10-16 01:44:56,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2020-10-16 01:44:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2020-10-16 01:44:56,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:56,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2020-10-16 01:44:56,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:56,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:56,989 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:56,989 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 273 flow. Second operand 5 states and 487 transitions. [2020-10-16 01:44:56,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 405 flow [2020-10-16 01:44:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 374 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 01:44:56,992 INFO L241 Difference]: Finished difference. Result has 45 places, 40 transitions, 340 flow [2020-10-16 01:44:56,993 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2020-10-16 01:44:56,993 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2020-10-16 01:44:56,993 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 340 flow [2020-10-16 01:44:56,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:44:56,993 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:56,993 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:56,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:44:56,994 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 98994686, now seen corresponding path program 1 times [2020-10-16 01:44:56,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:56,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593461474] [2020-10-16 01:44:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593461474] [2020-10-16 01:44:57,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:44:57,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083418482] [2020-10-16 01:44:57,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:44:57,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:44:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:44:57,041 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 140 [2020-10-16 01:44:57,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 340 flow. Second operand 3 states. [2020-10-16 01:44:57,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 140 [2020-10-16 01:44:57,041 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,070 INFO L129 PetriNetUnfolder]: 31/101 cut-off events. [2020-10-16 01:44:57,070 INFO L130 PetriNetUnfolder]: For 572/602 co-relation queries the response was YES. [2020-10-16 01:44:57,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 101 events. 31/101 cut-off events. For 572/602 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 422 event pairs, 3 based on Foata normal form. 9/106 useless extension candidates. Maximal degree in co-relation 457. Up to 42 conditions per place. [2020-10-16 01:44:57,071 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 3 selfloop transitions, 3 changer transitions 5/40 dead transitions. [2020-10-16 01:44:57,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 352 flow [2020-10-16 01:44:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:44:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:44:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2020-10-16 01:44:57,074 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2020-10-16 01:44:57,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2020-10-16 01:44:57,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2020-10-16 01:44:57,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2020-10-16 01:44:57,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:44:57,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:44:57,077 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:44:57,077 INFO L185 Difference]: Start difference. First operand has 45 places, 40 transitions, 340 flow. Second operand 3 states and 354 transitions. [2020-10-16 01:44:57,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 352 flow [2020-10-16 01:44:57,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 341 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 01:44:57,081 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 292 flow [2020-10-16 01:44:57,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2020-10-16 01:44:57,081 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 23 predicate places. [2020-10-16 01:44:57,081 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 292 flow [2020-10-16 01:44:57,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:44:57,081 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,082 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:44:57,082 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -95295310, now seen corresponding path program 1 times [2020-10-16 01:44:57,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100811834] [2020-10-16 01:44:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,285 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:44:57,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100811834] [2020-10-16 01:44:57,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:44:57,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626403578] [2020-10-16 01:44:57,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:44:57,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:44:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:44:57,288 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 140 [2020-10-16 01:44:57,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 292 flow. Second operand 7 states. [2020-10-16 01:44:57,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 140 [2020-10-16 01:44:57,289 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,471 INFO L129 PetriNetUnfolder]: 31/107 cut-off events. [2020-10-16 01:44:57,471 INFO L130 PetriNetUnfolder]: For 491/528 co-relation queries the response was YES. [2020-10-16 01:44:57,472 INFO L80 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 107 events. 31/107 cut-off events. For 491/528 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 474 event pairs, 1 based on Foata normal form. 17/122 useless extension candidates. Maximal degree in co-relation 514. Up to 55 conditions per place. [2020-10-16 01:44:57,473 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 9 selfloop transitions, 13 changer transitions 7/39 dead transitions. [2020-10-16 01:44:57,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 386 flow [2020-10-16 01:44:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:44:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:44:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2020-10-16 01:44:57,476 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6724489795918367 [2020-10-16 01:44:57,476 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2020-10-16 01:44:57,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2020-10-16 01:44:57,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2020-10-16 01:44:57,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:44:57,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:44:57,481 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:44:57,481 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 292 flow. Second operand 7 states and 659 transitions. [2020-10-16 01:44:57,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 386 flow [2020-10-16 01:44:57,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 371 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:44:57,484 INFO L241 Difference]: Finished difference. Result has 52 places, 31 transitions, 272 flow [2020-10-16 01:44:57,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2020-10-16 01:44:57,485 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 28 predicate places. [2020-10-16 01:44:57,485 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 272 flow [2020-10-16 01:44:57,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:44:57,485 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,486 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:44:57,486 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -392881874, now seen corresponding path program 2 times [2020-10-16 01:44:57,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25455399] [2020-10-16 01:44:57,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:44:57,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25455399] [2020-10-16 01:44:57,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:57,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:44:57,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422709912] [2020-10-16 01:44:57,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:44:57,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:44:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:44:57,735 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 140 [2020-10-16 01:44:57,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 31 transitions, 272 flow. Second operand 7 states. [2020-10-16 01:44:57,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:57,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 140 [2020-10-16 01:44:57,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:57,850 INFO L129 PetriNetUnfolder]: 28/92 cut-off events. [2020-10-16 01:44:57,850 INFO L130 PetriNetUnfolder]: For 466/483 co-relation queries the response was YES. [2020-10-16 01:44:57,851 INFO L80 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 92 events. 28/92 cut-off events. For 466/483 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 361 event pairs, 8 based on Foata normal form. 9/99 useless extension candidates. Maximal degree in co-relation 505. Up to 64 conditions per place. [2020-10-16 01:44:57,852 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 15 selfloop transitions, 3 changer transitions 6/34 dead transitions. [2020-10-16 01:44:57,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 34 transitions, 352 flow [2020-10-16 01:44:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2020-10-16 01:44:57,855 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6985714285714286 [2020-10-16 01:44:57,855 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 489 transitions. [2020-10-16 01:44:57,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 489 transitions. [2020-10-16 01:44:57,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:57,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 489 transitions. [2020-10-16 01:44:57,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:57,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:57,859 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:57,859 INFO L185 Difference]: Start difference. First operand has 52 places, 31 transitions, 272 flow. Second operand 5 states and 489 transitions. [2020-10-16 01:44:57,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 34 transitions, 352 flow [2020-10-16 01:44:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 294 flow, removed 8 selfloop flow, removed 7 redundant places. [2020-10-16 01:44:57,864 INFO L241 Difference]: Finished difference. Result has 48 places, 28 transitions, 209 flow [2020-10-16 01:44:57,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2020-10-16 01:44:57,864 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 24 predicate places. [2020-10-16 01:44:57,864 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 209 flow [2020-10-16 01:44:57,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:44:57,864 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:57,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:57,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:44:57,865 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1661273764, now seen corresponding path program 3 times [2020-10-16 01:44:57,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:57,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150403989] [2020-10-16 01:44:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,050 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:44:58,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150403989] [2020-10-16 01:44:58,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:44:58,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912684280] [2020-10-16 01:44:58,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:44:58,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:44:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:44:58,054 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 140 [2020-10-16 01:44:58,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 209 flow. Second operand 7 states. [2020-10-16 01:44:58,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 140 [2020-10-16 01:44:58,055 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,224 INFO L129 PetriNetUnfolder]: 22/92 cut-off events. [2020-10-16 01:44:58,224 INFO L130 PetriNetUnfolder]: For 438/462 co-relation queries the response was YES. [2020-10-16 01:44:58,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 92 events. 22/92 cut-off events. For 438/462 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 413 event pairs, 0 based on Foata normal form. 14/104 useless extension candidates. Maximal degree in co-relation 401. Up to 32 conditions per place. [2020-10-16 01:44:58,225 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 10 selfloop transitions, 9 changer transitions 3/31 dead transitions. [2020-10-16 01:44:58,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 275 flow [2020-10-16 01:44:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:44:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:44:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 560 transitions. [2020-10-16 01:44:58,228 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2020-10-16 01:44:58,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 560 transitions. [2020-10-16 01:44:58,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 560 transitions. [2020-10-16 01:44:58,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 560 transitions. [2020-10-16 01:44:58,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:44:58,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:44:58,232 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:44:58,232 INFO L185 Difference]: Start difference. First operand has 48 places, 28 transitions, 209 flow. Second operand 6 states and 560 transitions. [2020-10-16 01:44:58,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 275 flow [2020-10-16 01:44:58,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 260 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-16 01:44:58,235 INFO L241 Difference]: Finished difference. Result has 46 places, 26 transitions, 205 flow [2020-10-16 01:44:58,235 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2020-10-16 01:44:58,235 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2020-10-16 01:44:58,235 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 205 flow [2020-10-16 01:44:58,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:44:58,235 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,236 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:44:58,236 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1274729718, now seen corresponding path program 1 times [2020-10-16 01:44:58,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413129595] [2020-10-16 01:44:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,273 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:44:58,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413129595] [2020-10-16 01:44:58,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:44:58,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367048738] [2020-10-16 01:44:58,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:44:58,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:44:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:44:58,275 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2020-10-16 01:44:58,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 205 flow. Second operand 4 states. [2020-10-16 01:44:58,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2020-10-16 01:44:58,276 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,310 INFO L129 PetriNetUnfolder]: 16/75 cut-off events. [2020-10-16 01:44:58,310 INFO L130 PetriNetUnfolder]: For 281/296 co-relation queries the response was YES. [2020-10-16 01:44:58,311 INFO L80 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 75 events. 16/75 cut-off events. For 281/296 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 286 event pairs, 5 based on Foata normal form. 24/98 useless extension candidates. Maximal degree in co-relation 258. Up to 37 conditions per place. [2020-10-16 01:44:58,311 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 4 selfloop transitions, 5 changer transitions 4/28 dead transitions. [2020-10-16 01:44:58,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 28 transitions, 201 flow [2020-10-16 01:44:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:44:58,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:44:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2020-10-16 01:44:58,314 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7914285714285715 [2020-10-16 01:44:58,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2020-10-16 01:44:58,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2020-10-16 01:44:58,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2020-10-16 01:44:58,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:44:58,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:44:58,318 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:44:58,318 INFO L185 Difference]: Start difference. First operand has 46 places, 26 transitions, 205 flow. Second operand 5 states and 554 transitions. [2020-10-16 01:44:58,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 28 transitions, 201 flow [2020-10-16 01:44:58,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 28 transitions, 170 flow, removed 3 selfloop flow, removed 9 redundant places. [2020-10-16 01:44:58,321 INFO L241 Difference]: Finished difference. Result has 43 places, 24 transitions, 166 flow [2020-10-16 01:44:58,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2020-10-16 01:44:58,321 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2020-10-16 01:44:58,321 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 166 flow [2020-10-16 01:44:58,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:44:58,322 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,322 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:44:58,322 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,322 INFO L82 PathProgramCache]: Analyzing trace with hash -921286340, now seen corresponding path program 1 times [2020-10-16 01:44:58,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438122738] [2020-10-16 01:44:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:44:58,366 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:44:58,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438122738] [2020-10-16 01:44:58,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:44:58,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:44:58,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123697087] [2020-10-16 01:44:58,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:44:58,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:44:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:44:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:44:58,369 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 140 [2020-10-16 01:44:58,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 166 flow. Second operand 5 states. [2020-10-16 01:44:58,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:44:58,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 140 [2020-10-16 01:44:58,370 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:44:58,413 INFO L129 PetriNetUnfolder]: 5/44 cut-off events. [2020-10-16 01:44:58,414 INFO L130 PetriNetUnfolder]: For 205/251 co-relation queries the response was YES. [2020-10-16 01:44:58,414 INFO L80 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 44 events. 5/44 cut-off events. For 205/251 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 122 event pairs, 0 based on Foata normal form. 31/74 useless extension candidates. Maximal degree in co-relation 164. Up to 20 conditions per place. [2020-10-16 01:44:58,414 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 8 changer transitions 5/27 dead transitions. [2020-10-16 01:44:58,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 27 transitions, 204 flow [2020-10-16 01:44:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:44:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:44:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions. [2020-10-16 01:44:58,418 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2020-10-16 01:44:58,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 770 transitions. [2020-10-16 01:44:58,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions. [2020-10-16 01:44:58,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:44:58,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions. [2020-10-16 01:44:58,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:44:58,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:44:58,422 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:44:58,423 INFO L185 Difference]: Start difference. First operand has 43 places, 24 transitions, 166 flow. Second operand 7 states and 770 transitions. [2020-10-16 01:44:58,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 27 transitions, 204 flow [2020-10-16 01:44:58,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 27 transitions, 186 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:44:58,425 INFO L241 Difference]: Finished difference. Result has 49 places, 22 transitions, 157 flow [2020-10-16 01:44:58,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2020-10-16 01:44:58,425 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2020-10-16 01:44:58,425 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 22 transitions, 157 flow [2020-10-16 01:44:58,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:44:58,425 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:44:58,426 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:44:58,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:44:58,426 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:44:58,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:44:58,426 INFO L82 PathProgramCache]: Analyzing trace with hash 434450680, now seen corresponding path program 1 times [2020-10-16 01:44:58,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:44:58,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714082349] [2020-10-16 01:44:58,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:44:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:44:58,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:44:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:44:58,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:44:58,520 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:44:58,521 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:44:58,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:44:58,522 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:44:58,531 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L3-->L793: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In-783665227 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In-783665227 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In-783665227 256) 0)) (.cse9 (= 0 (mod ~x$r_buff0_thd0~0_In-783665227 256)))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-783665227 0)) (= ~x$r_buff1_thd0~0_Out-783665227 ~x$r_buff1_thd0~0_In-783665227) (or (and .cse0 (= ~x$w_buff0_used~0_Out-783665227 0) .cse1) (and .cse2 (= ~x$w_buff0_used~0_Out-783665227 ~x$w_buff0_used~0_In-783665227))) (= ~x$r_buff0_thd0~0_In-783665227 ~x$r_buff0_thd0~0_Out-783665227) (or (and .cse0 .cse1 (= ~x$w_buff0~0_In-783665227 ~x~0_Out-783665227)) (and (or (and (= ~x$w_buff1~0_In-783665227 ~x~0_Out-783665227) .cse3 .cse4) (and .cse5 (= ~x~0_In-783665227 ~x~0_Out-783665227))) .cse2)) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out-783665227 0)) (and (= ~x$w_buff1_used~0_In-783665227 ~x$w_buff1_used~0_Out-783665227) .cse5))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-783665227, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-783665227, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-783665227, ~x$w_buff1~0=~x$w_buff1~0_In-783665227, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-783665227, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-783665227, ~x~0=~x~0_In-783665227, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-783665227} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-783665227, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-783665227, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-783665227|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-783665227|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-783665227|, ~x$w_buff1~0=~x$w_buff1~0_In-783665227, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-783665227, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-783665227|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-783665227, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-783665227|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-783665227|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-783665227, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-783665227, ~x~0=~x~0_Out-783665227} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 01:44:58,536 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:44:58,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,538 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:44:58,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,538 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:44:58,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,539 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:44:58,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,539 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:44:58,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,540 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:44:58,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,540 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:44:58,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,541 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:44:58,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,541 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:44:58,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,541 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:44:58,541 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,542 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:44:58,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,542 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:44:58,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,542 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:44:58,542 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,543 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:44:58,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,544 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:44:58,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,544 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:44:58,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,544 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:44:58,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,545 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:44:58,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,545 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:44:58,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,545 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:44:58,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,546 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:44:58,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,546 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:44:58,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,546 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:44:58,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:44:58,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:44:58 BasicIcfg [2020-10-16 01:44:58,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:44:58,613 INFO L168 Benchmark]: Toolchain (without parser) took 16251.52 ms. Allocated memory was 251.1 MB in the beginning and 573.6 MB in the end (delta: 322.4 MB). Free memory was 206.7 MB in the beginning and 185.1 MB in the end (delta: 21.6 MB). Peak memory consumption was 344.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,613 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.23 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.7 MB in the beginning and 265.7 MB in the end (delta: -59.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.36 ms. Allocated memory is still 314.0 MB. Free memory was 265.7 MB in the beginning and 262.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,619 INFO L168 Benchmark]: Boogie Preprocessor took 62.23 ms. Allocated memory is still 314.0 MB. Free memory was 262.4 MB in the beginning and 260.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,619 INFO L168 Benchmark]: RCFGBuilder took 2204.23 ms. Allocated memory was 314.0 MB in the beginning and 357.0 MB in the end (delta: 43.0 MB). Free memory was 260.7 MB in the beginning and 212.4 MB in the end (delta: 48.3 MB). Peak memory consumption was 100.6 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,620 INFO L168 Benchmark]: TraceAbstraction took 13122.07 ms. Allocated memory was 357.0 MB in the beginning and 573.6 MB in the end (delta: 216.5 MB). Free memory was 212.4 MB in the beginning and 185.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 243.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:44:58,625 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.41 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 775.23 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 206.7 MB in the beginning and 265.7 MB in the end (delta: -59.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 78.36 ms. Allocated memory is still 314.0 MB. Free memory was 265.7 MB in the beginning and 262.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 62.23 ms. Allocated memory is still 314.0 MB. Free memory was 262.4 MB in the beginning and 260.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2204.23 ms. Allocated memory was 314.0 MB in the beginning and 357.0 MB in the end (delta: 43.0 MB). Free memory was 260.7 MB in the beginning and 212.4 MB in the end (delta: 48.3 MB). Peak memory consumption was 100.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13122.07 ms. Allocated memory was 357.0 MB in the beginning and 573.6 MB in the end (delta: 216.5 MB). Free memory was 212.4 MB in the beginning and 185.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 243.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 581 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 51 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.0s, 77 PlacesBefore, 24 PlacesAfterwards, 72 TransitionsBefore, 18 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2287 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L702] 0 _Bool x$flush_delayed; [L703] 0 int x$mem_tmp; [L704] 0 _Bool x$r_buff0_thd0; [L705] 0 _Bool x$r_buff0_thd1; [L706] 0 _Bool x$r_buff0_thd2; [L707] 0 _Bool x$r_buff1_thd0; [L708] 0 _Bool x$r_buff1_thd1; [L709] 0 _Bool x$r_buff1_thd2; [L710] 0 _Bool x$read_delayed; [L711] 0 int *x$read_delayed_var; [L712] 0 int x$w_buff0; [L713] 0 _Bool x$w_buff0_used; [L714] 0 int x$w_buff1; [L715] 0 _Bool x$w_buff1_used; [L717] 0 int y = 0; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2475; [L780] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2476; [L782] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 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: 12.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 52 SDtfs, 23 SDslu, 11 SDs, 0 SdLazy, 279 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=8, 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.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 11536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...