/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:01:38,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:01:38,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:01:38,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:01:38,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:01:38,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:01:38,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:01:38,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:01:38,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:01:38,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:01:38,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:01:38,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:01:38,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:01:38,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:01:38,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:01:38,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:01:38,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:01:38,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:01:38,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:01:38,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:01:38,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:01:38,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:01:38,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:01:38,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:01:38,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:01:38,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:01:38,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:01:38,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:01:38,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:01:38,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:01:38,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:01:38,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:01:38,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:01:38,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:01:38,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:01:38,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:01:38,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:01:38,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:01:38,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:01:38,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:01:38,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:01:38,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:01:38,317 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:01:38,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:01:38,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:01:38,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:01:38,319 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:01:38,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:01:38,320 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:01:38,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:01:38,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:01:38,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:01:38,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:01:38,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:01:38,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:01:38,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:01:38,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:01:38,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:01:38,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:01:38,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:01:38,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:01:38,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:01:38,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:01:38,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:01:38,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:01:38,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:01:38,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:01:38,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:01:38,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:01:38,671 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:01:38,672 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:01:38,672 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.oepc.i [2020-10-16 05:01:38,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18f8649c/9c8e24d1b3a84122910e768cf4f55d79/FLAG3892b595d [2020-10-16 05:01:39,279 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:01:39,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.oepc.i [2020-10-16 05:01:39,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18f8649c/9c8e24d1b3a84122910e768cf4f55d79/FLAG3892b595d [2020-10-16 05:01:39,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b18f8649c/9c8e24d1b3a84122910e768cf4f55d79 [2020-10-16 05:01:39,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:01:39,572 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:01:39,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:01:39,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:01:39,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:01:39,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:39" (1/1) ... [2020-10-16 05:01:39,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f2218c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:39, skipping insertion in model container [2020-10-16 05:01:39,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:39" (1/1) ... [2020-10-16 05:01:39,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:01:39,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:01:40,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:01:40,246 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:01:40,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:01:40,398 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:01:40,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40 WrapperNode [2020-10-16 05:01:40,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:01:40,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:01:40,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:01:40,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:01:40,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:01:40,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:01:40,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:01:40,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:01:40,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (1/1) ... [2020-10-16 05:01:40,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:01:40,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:01:40,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:01:40,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:01:40,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (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 05:01:40,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:01:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:01:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:01:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:01:40,599 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:01:40,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:01:40,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:01:40,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:01:40,602 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:01:40,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:01:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:01:40,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:01:40,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:01:40,607 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 05:01:43,620 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:01:43,620 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:01:43,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:43 BoogieIcfgContainer [2020-10-16 05:01:43,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:01:43,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:01:43,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:01:43,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:01:43,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:01:39" (1/3) ... [2020-10-16 05:01:43,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506c399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:43, skipping insertion in model container [2020-10-16 05:01:43,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:40" (2/3) ... [2020-10-16 05:01:43,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506c399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:43, skipping insertion in model container [2020-10-16 05:01:43,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:43" (3/3) ... [2020-10-16 05:01:43,631 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc.i [2020-10-16 05:01:43,643 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:01:43,651 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:01:43,652 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:01:43,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,731 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:43,754 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:01:43,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:01:43,778 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:01:43,779 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:01:43,779 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:01:43,779 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:01:43,779 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:01:43,779 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:01:43,779 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:01:43,794 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:01:43,898 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:01:43,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:43,903 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:01:43,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:01:43,912 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 05:01:43,914 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:01:43,917 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:01:43,920 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:01:43,920 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 05:01:43,956 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:01:43,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:43,957 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:01:43,961 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 05:01:44,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:44,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:44,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:44,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:44,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:44,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:44,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:44,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:44,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:44,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:44,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:44,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:44,538 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:01:44,643 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:01:44,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:44,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:44,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:44,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:44,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:44,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:44,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:44,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:44,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:44,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:44,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:44,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:44,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:01:44,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:46,590 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 215 DAG size of output: 174 [2020-10-16 05:01:47,168 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2020-10-16 05:01:47,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:47,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:47,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:47,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:47,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:47,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:47,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:47,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:47,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:47,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:47,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:47,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:47,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:47,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:47,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:47,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,217 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:01:48,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:48,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:48,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:48,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 4, 3, 2, 1] term [2020-10-16 05:01:48,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:01:48,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:01:48,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:48,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:48,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:48,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:48,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:48,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:01:48,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:48,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:48,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:48,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:48,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:48,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:49,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:49,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:49,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:49,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:49,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:49,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:49,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:49,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:49,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:49,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:49,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:49,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:49,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:49,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:49,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:49,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:49,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:49,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:49,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:49,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:49,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:49,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:49,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:49,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:49,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:49,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:49,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:49,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:49,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:49,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:49,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:49,843 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 05:01:49,964 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 05:01:49,971 INFO L132 LiptonReduction]: Checked pairs total: 4298 [2020-10-16 05:01:49,972 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 05:01:49,975 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6063 [2020-10-16 05:01:49,980 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 05:01:49,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:49,981 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:49,981 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:01:49,982 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1683620, now seen corresponding path program 1 times [2020-10-16 05:01:49,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:49,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513588933] [2020-10-16 05:01:49,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:50,248 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 05:01:50,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513588933] [2020-10-16 05:01:50,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:50,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:01:50,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21485920] [2020-10-16 05:01:50,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:01:50,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:01:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:01:50,278 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 167 [2020-10-16 05:01:50,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 05:01:50,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:50,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 167 [2020-10-16 05:01:50,281 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:50,425 INFO L129 PetriNetUnfolder]: 115/265 cut-off events. [2020-10-16 05:01:50,425 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:50,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 265 events. 115/265 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1398 event pairs, 92 based on Foata normal form. 23/267 useless extension candidates. Maximal degree in co-relation 453. Up to 141 conditions per place. [2020-10-16 05:01:50,430 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 13 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 05:01:50,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 97 flow [2020-10-16 05:01:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:01:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:01:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2020-10-16 05:01:50,449 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8622754491017964 [2020-10-16 05:01:50,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2020-10-16 05:01:50,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2020-10-16 05:01:50,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:50,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2020-10-16 05:01:50,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:01:50,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:01:50,472 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:01:50,475 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 432 transitions. [2020-10-16 05:01:50,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 97 flow [2020-10-16 05:01:50,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:50,480 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 05:01:50,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 05:01:50,484 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 05:01:50,484 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 05:01:50,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:01:50,484 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:50,485 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:50,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:01:50,485 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1154083568, now seen corresponding path program 1 times [2020-10-16 05:01:50,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:50,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899759675] [2020-10-16 05:01:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:50,673 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 05:01:50,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899759675] [2020-10-16 05:01:50,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:50,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:01:50,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984790006] [2020-10-16 05:01:50,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:50,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:50,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:50,679 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 167 [2020-10-16 05:01:50,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 05:01:50,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:50,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 167 [2020-10-16 05:01:50,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:50,742 INFO L129 PetriNetUnfolder]: 12/72 cut-off events. [2020-10-16 05:01:50,742 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:50,743 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 72 events. 12/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 253 event pairs, 3 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 107. Up to 20 conditions per place. [2020-10-16 05:01:50,743 INFO L132 encePairwiseOnDemand]: 162/167 looper letters, 4 selfloop transitions, 3 changer transitions 8/32 dead transitions. [2020-10-16 05:01:50,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 104 flow [2020-10-16 05:01:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:01:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:01:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2020-10-16 05:01:50,749 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8526946107784431 [2020-10-16 05:01:50,750 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2020-10-16 05:01:50,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2020-10-16 05:01:50,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:50,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2020-10-16 05:01:50,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:01:50,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:01:50,756 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:01:50,756 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 712 transitions. [2020-10-16 05:01:50,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 104 flow [2020-10-16 05:01:50,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:50,758 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 05:01:50,758 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 05:01:50,759 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 05:01:50,759 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 05:01:50,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:50,759 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:50,759 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:50,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:01:50,760 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1416943019, now seen corresponding path program 1 times [2020-10-16 05:01:50,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:50,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105365375] [2020-10-16 05:01:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:50,883 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 05:01:50,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105365375] [2020-10-16 05:01:50,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:50,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:01:50,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037196920] [2020-10-16 05:01:50,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:50,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:50,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:50,888 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 167 [2020-10-16 05:01:50,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 4 states. [2020-10-16 05:01:50,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:50,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 167 [2020-10-16 05:01:50,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:50,947 INFO L129 PetriNetUnfolder]: 7/52 cut-off events. [2020-10-16 05:01:50,947 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2020-10-16 05:01:50,948 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 52 events. 7/52 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 3 based on Foata normal form. 5/53 useless extension candidates. Maximal degree in co-relation 98. Up to 17 conditions per place. [2020-10-16 05:01:50,948 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 2 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2020-10-16 05:01:50,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 95 flow [2020-10-16 05:01:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:01:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:01:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2020-10-16 05:01:50,952 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8359281437125748 [2020-10-16 05:01:50,952 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2020-10-16 05:01:50,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2020-10-16 05:01:50,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:50,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2020-10-16 05:01:50,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:01:50,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:01:50,957 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:01:50,957 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 698 transitions. [2020-10-16 05:01:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 95 flow [2020-10-16 05:01:50,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 90 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:50,959 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 84 flow [2020-10-16 05:01:50,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2020-10-16 05:01:50,960 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 05:01:50,960 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 84 flow [2020-10-16 05:01:50,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:50,960 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:50,960 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:50,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:01:50,961 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash -13018571, now seen corresponding path program 1 times [2020-10-16 05:01:50,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:50,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011908189] [2020-10-16 05:01:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:51,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011908189] [2020-10-16 05:01:51,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:51,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:01:51,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233957927] [2020-10-16 05:01:51,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:01:51,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:51,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:01:51,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:01:51,247 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 167 [2020-10-16 05:01:51,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 84 flow. Second operand 6 states. [2020-10-16 05:01:51,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:51,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 167 [2020-10-16 05:01:51,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:51,587 INFO L129 PetriNetUnfolder]: 368/662 cut-off events. [2020-10-16 05:01:51,588 INFO L130 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2020-10-16 05:01:51,591 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 662 events. 368/662 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3408 event pairs, 87 based on Foata normal form. 28/658 useless extension candidates. Maximal degree in co-relation 1576. Up to 289 conditions per place. [2020-10-16 05:01:51,594 INFO L132 encePairwiseOnDemand]: 161/167 looper letters, 15 selfloop transitions, 4 changer transitions 15/47 dead transitions. [2020-10-16 05:01:51,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 212 flow [2020-10-16 05:01:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:01:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:01:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 720 transitions. [2020-10-16 05:01:51,598 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.718562874251497 [2020-10-16 05:01:51,598 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 720 transitions. [2020-10-16 05:01:51,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 720 transitions. [2020-10-16 05:01:51,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:51,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 720 transitions. [2020-10-16 05:01:51,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:01:51,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:01:51,603 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:01:51,603 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 84 flow. Second operand 6 states and 720 transitions. [2020-10-16 05:01:51,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 212 flow [2020-10-16 05:01:51,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 200 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:01:51,607 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 110 flow [2020-10-16 05:01:51,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2020-10-16 05:01:51,608 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 05:01:51,608 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 110 flow [2020-10-16 05:01:51,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:01:51,608 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:51,608 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:51,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:01:51,608 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:51,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2066308180, now seen corresponding path program 1 times [2020-10-16 05:01:51,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:51,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5694144] [2020-10-16 05:01:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:51,708 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 05:01:51,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5694144] [2020-10-16 05:01:51,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:51,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:01:51,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687853242] [2020-10-16 05:01:51,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:51,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:51,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:51,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:51,715 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 167 [2020-10-16 05:01:51,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 110 flow. Second operand 4 states. [2020-10-16 05:01:51,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:51,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 167 [2020-10-16 05:01:51,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:51,770 INFO L129 PetriNetUnfolder]: 10/76 cut-off events. [2020-10-16 05:01:51,771 INFO L130 PetriNetUnfolder]: For 152/184 co-relation queries the response was YES. [2020-10-16 05:01:51,772 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 76 events. 10/76 cut-off events. For 152/184 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 317 event pairs, 5 based on Foata normal form. 5/74 useless extension candidates. Maximal degree in co-relation 200. Up to 22 conditions per place. [2020-10-16 05:01:51,772 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 5 selfloop transitions, 3 changer transitions 2/29 dead transitions. [2020-10-16 05:01:51,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 29 transitions, 154 flow [2020-10-16 05:01:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:01:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:01:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2020-10-16 05:01:51,775 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8455089820359282 [2020-10-16 05:01:51,776 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2020-10-16 05:01:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2020-10-16 05:01:51,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:51,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2020-10-16 05:01:51,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:01:51,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:01:51,780 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:01:51,780 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 110 flow. Second operand 5 states and 706 transitions. [2020-10-16 05:01:51,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 29 transitions, 154 flow [2020-10-16 05:01:51,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 137 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:51,785 INFO L241 Difference]: Finished difference. Result has 44 places, 26 transitions, 114 flow [2020-10-16 05:01:51,786 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2020-10-16 05:01:51,786 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2020-10-16 05:01:51,786 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 114 flow [2020-10-16 05:01:51,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:51,786 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:51,786 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:51,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:01:51,787 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1349835146, now seen corresponding path program 1 times [2020-10-16 05:01:51,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:51,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836501615] [2020-10-16 05:01:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:52,043 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 05:01:52,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836501615] [2020-10-16 05:01:52,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:52,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:01:52,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456704187] [2020-10-16 05:01:52,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:01:52,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:01:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:01:52,048 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 167 [2020-10-16 05:01:52,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 26 transitions, 114 flow. Second operand 6 states. [2020-10-16 05:01:52,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:52,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 167 [2020-10-16 05:01:52,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:52,646 INFO L129 PetriNetUnfolder]: 352/716 cut-off events. [2020-10-16 05:01:52,647 INFO L130 PetriNetUnfolder]: For 1213/1241 co-relation queries the response was YES. [2020-10-16 05:01:52,651 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 716 events. 352/716 cut-off events. For 1213/1241 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4196 event pairs, 109 based on Foata normal form. 40/734 useless extension candidates. Maximal degree in co-relation 1845. Up to 368 conditions per place. [2020-10-16 05:01:52,656 INFO L132 encePairwiseOnDemand]: 157/167 looper letters, 19 selfloop transitions, 9 changer transitions 9/50 dead transitions. [2020-10-16 05:01:52,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 284 flow [2020-10-16 05:01:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:01:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:01:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2020-10-16 05:01:52,662 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6852010265183918 [2020-10-16 05:01:52,662 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2020-10-16 05:01:52,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2020-10-16 05:01:52,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:52,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2020-10-16 05:01:52,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:01:52,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:01:52,671 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:01:52,671 INFO L185 Difference]: Start difference. First operand has 44 places, 26 transitions, 114 flow. Second operand 7 states and 801 transitions. [2020-10-16 05:01:52,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 284 flow [2020-10-16 05:01:52,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 267 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:52,681 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 181 flow [2020-10-16 05:01:52,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2020-10-16 05:01:52,682 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2020-10-16 05:01:52,682 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 181 flow [2020-10-16 05:01:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:01:52,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:52,683 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:52,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:01:52,683 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1261053161, now seen corresponding path program 1 times [2020-10-16 05:01:52,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:52,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301295896] [2020-10-16 05:01:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:52,936 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 05:01:52,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301295896] [2020-10-16 05:01:52,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:52,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:52,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151446885] [2020-10-16 05:01:52,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:52,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:52,942 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 167 [2020-10-16 05:01:52,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 181 flow. Second operand 7 states. [2020-10-16 05:01:52,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:52,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 167 [2020-10-16 05:01:52,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:53,349 INFO L129 PetriNetUnfolder]: 342/669 cut-off events. [2020-10-16 05:01:53,349 INFO L130 PetriNetUnfolder]: For 1510/1532 co-relation queries the response was YES. [2020-10-16 05:01:53,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 669 events. 342/669 cut-off events. For 1510/1532 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3710 event pairs, 144 based on Foata normal form. 21/669 useless extension candidates. Maximal degree in co-relation 2539. Up to 483 conditions per place. [2020-10-16 05:01:53,357 INFO L132 encePairwiseOnDemand]: 157/167 looper letters, 21 selfloop transitions, 20 changer transitions 7/61 dead transitions. [2020-10-16 05:01:53,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 459 flow [2020-10-16 05:01:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:01:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:01:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 946 transitions. [2020-10-16 05:01:53,362 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7080838323353293 [2020-10-16 05:01:53,362 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 946 transitions. [2020-10-16 05:01:53,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 946 transitions. [2020-10-16 05:01:53,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:53,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 946 transitions. [2020-10-16 05:01:53,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:01:53,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:01:53,369 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:01:53,369 INFO L185 Difference]: Start difference. First operand has 49 places, 32 transitions, 181 flow. Second operand 8 states and 946 transitions. [2020-10-16 05:01:53,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 459 flow [2020-10-16 05:01:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 444 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:53,378 INFO L241 Difference]: Finished difference. Result has 56 places, 50 transitions, 356 flow [2020-10-16 05:01:53,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2020-10-16 05:01:53,379 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 05:01:53,379 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 356 flow [2020-10-16 05:01:53,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:53,379 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:53,379 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:53,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:01:53,380 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -202219423, now seen corresponding path program 2 times [2020-10-16 05:01:53,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:53,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679825075] [2020-10-16 05:01:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:53,711 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 05:01:53,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679825075] [2020-10-16 05:01:53,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:53,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:01:53,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548245607] [2020-10-16 05:01:53,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:01:53,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:01:53,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:01:53,717 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 167 [2020-10-16 05:01:53,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 356 flow. Second operand 8 states. [2020-10-16 05:01:53,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:53,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 167 [2020-10-16 05:01:53,718 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:54,216 INFO L129 PetriNetUnfolder]: 335/662 cut-off events. [2020-10-16 05:01:54,217 INFO L130 PetriNetUnfolder]: For 1957/2010 co-relation queries the response was YES. [2020-10-16 05:01:54,219 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 662 events. 335/662 cut-off events. For 1957/2010 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3697 event pairs, 144 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 2878. Up to 481 conditions per place. [2020-10-16 05:01:54,224 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 28 selfloop transitions, 28 changer transitions 10/79 dead transitions. [2020-10-16 05:01:54,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 761 flow [2020-10-16 05:01:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:01:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:01:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1016 transitions. [2020-10-16 05:01:54,229 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.675981370592149 [2020-10-16 05:01:54,229 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1016 transitions. [2020-10-16 05:01:54,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1016 transitions. [2020-10-16 05:01:54,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:54,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1016 transitions. [2020-10-16 05:01:54,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:01:54,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:01:54,235 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:01:54,235 INFO L185 Difference]: Start difference. First operand has 56 places, 50 transitions, 356 flow. Second operand 9 states and 1016 transitions. [2020-10-16 05:01:54,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 761 flow [2020-10-16 05:01:54,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 79 transitions, 703 flow, removed 29 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:54,243 INFO L241 Difference]: Finished difference. Result has 66 places, 64 transitions, 547 flow [2020-10-16 05:01:54,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=547, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2020-10-16 05:01:54,244 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2020-10-16 05:01:54,244 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 547 flow [2020-10-16 05:01:54,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:01:54,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:54,244 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:54,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:01:54,245 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:54,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1800470554, now seen corresponding path program 1 times [2020-10-16 05:01:54,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:54,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065009516] [2020-10-16 05:01:54,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:54,406 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 05:01:54,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065009516] [2020-10-16 05:01:54,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:54,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:54,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797195355] [2020-10-16 05:01:54,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:54,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:54,410 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 167 [2020-10-16 05:01:54,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 547 flow. Second operand 7 states. [2020-10-16 05:01:54,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:54,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 167 [2020-10-16 05:01:54,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:54,929 INFO L129 PetriNetUnfolder]: 383/777 cut-off events. [2020-10-16 05:01:54,929 INFO L130 PetriNetUnfolder]: For 3070/3126 co-relation queries the response was YES. [2020-10-16 05:01:54,933 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 777 events. 383/777 cut-off events. For 3070/3126 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4654 event pairs, 52 based on Foata normal form. 46/807 useless extension candidates. Maximal degree in co-relation 3488. Up to 388 conditions per place. [2020-10-16 05:01:54,937 INFO L132 encePairwiseOnDemand]: 159/167 looper letters, 49 selfloop transitions, 14 changer transitions 22/98 dead transitions. [2020-10-16 05:01:54,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 985 flow [2020-10-16 05:01:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:01:54,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:01:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 943 transitions. [2020-10-16 05:01:54,942 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7058383233532934 [2020-10-16 05:01:54,942 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 943 transitions. [2020-10-16 05:01:54,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 943 transitions. [2020-10-16 05:01:54,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:54,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 943 transitions. [2020-10-16 05:01:54,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:01:54,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:01:54,948 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:01:54,948 INFO L185 Difference]: Start difference. First operand has 66 places, 64 transitions, 547 flow. Second operand 8 states and 943 transitions. [2020-10-16 05:01:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 985 flow [2020-10-16 05:01:54,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 914 flow, removed 29 selfloop flow, removed 4 redundant places. [2020-10-16 05:01:54,963 INFO L241 Difference]: Finished difference. Result has 71 places, 66 transitions, 560 flow [2020-10-16 05:01:54,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=560, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2020-10-16 05:01:54,963 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2020-10-16 05:01:54,963 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 560 flow [2020-10-16 05:01:54,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:54,963 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:54,963 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:54,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:01:54,964 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 486239414, now seen corresponding path program 1 times [2020-10-16 05:01:54,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:54,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381011535] [2020-10-16 05:01:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:55,239 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 05:01:55,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381011535] [2020-10-16 05:01:55,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:55,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:01:55,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582687863] [2020-10-16 05:01:55,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:01:55,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:01:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:01:55,242 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 167 [2020-10-16 05:01:55,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 560 flow. Second operand 6 states. [2020-10-16 05:01:55,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:55,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 167 [2020-10-16 05:01:55,243 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:55,654 INFO L129 PetriNetUnfolder]: 225/478 cut-off events. [2020-10-16 05:01:55,654 INFO L130 PetriNetUnfolder]: For 2214/2285 co-relation queries the response was YES. [2020-10-16 05:01:55,657 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 478 events. 225/478 cut-off events. For 2214/2285 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2516 event pairs, 54 based on Foata normal form. 39/513 useless extension candidates. Maximal degree in co-relation 2293. Up to 301 conditions per place. [2020-10-16 05:01:55,660 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 33 selfloop transitions, 33 changer transitions 11/90 dead transitions. [2020-10-16 05:01:55,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 968 flow [2020-10-16 05:01:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:01:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:01:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 997 transitions. [2020-10-16 05:01:55,664 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6633399866932801 [2020-10-16 05:01:55,665 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 997 transitions. [2020-10-16 05:01:55,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 997 transitions. [2020-10-16 05:01:55,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:55,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 997 transitions. [2020-10-16 05:01:55,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:01:55,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:01:55,671 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:01:55,671 INFO L185 Difference]: Start difference. First operand has 71 places, 66 transitions, 560 flow. Second operand 9 states and 997 transitions. [2020-10-16 05:01:55,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 968 flow [2020-10-16 05:01:55,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 898 flow, removed 18 selfloop flow, removed 7 redundant places. [2020-10-16 05:01:55,680 INFO L241 Difference]: Finished difference. Result has 76 places, 73 transitions, 702 flow [2020-10-16 05:01:55,680 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=702, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2020-10-16 05:01:55,681 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2020-10-16 05:01:55,681 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 702 flow [2020-10-16 05:01:55,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:01:55,681 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:55,681 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:55,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:01:55,681 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1403967448, now seen corresponding path program 2 times [2020-10-16 05:01:55,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:55,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868905272] [2020-10-16 05:01:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:56,032 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 05:01:56,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868905272] [2020-10-16 05:01:56,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:56,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:01:56,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840687143] [2020-10-16 05:01:56,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:01:56,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:56,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:01:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:01:56,035 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 167 [2020-10-16 05:01:56,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 702 flow. Second operand 8 states. [2020-10-16 05:01:56,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:56,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 167 [2020-10-16 05:01:56,036 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:56,502 INFO L129 PetriNetUnfolder]: 214/448 cut-off events. [2020-10-16 05:01:56,503 INFO L130 PetriNetUnfolder]: For 3043/3104 co-relation queries the response was YES. [2020-10-16 05:01:56,505 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 448 events. 214/448 cut-off events. For 3043/3104 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2279 event pairs, 54 based on Foata normal form. 25/469 useless extension candidates. Maximal degree in co-relation 2491. Up to 310 conditions per place. [2020-10-16 05:01:56,510 INFO L132 encePairwiseOnDemand]: 161/167 looper letters, 44 selfloop transitions, 22 changer transitions 6/85 dead transitions. [2020-10-16 05:01:56,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 1020 flow [2020-10-16 05:01:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:01:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:01:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 889 transitions. [2020-10-16 05:01:56,515 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6654191616766467 [2020-10-16 05:01:56,515 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 889 transitions. [2020-10-16 05:01:56,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 889 transitions. [2020-10-16 05:01:56,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:56,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 889 transitions. [2020-10-16 05:01:56,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:01:56,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:01:56,522 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:01:56,523 INFO L185 Difference]: Start difference. First operand has 76 places, 73 transitions, 702 flow. Second operand 8 states and 889 transitions. [2020-10-16 05:01:56,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 1020 flow [2020-10-16 05:01:56,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 85 transitions, 917 flow, removed 31 selfloop flow, removed 6 redundant places. [2020-10-16 05:01:56,540 INFO L241 Difference]: Finished difference. Result has 77 places, 75 transitions, 727 flow [2020-10-16 05:01:56,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=727, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2020-10-16 05:01:56,541 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2020-10-16 05:01:56,541 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 727 flow [2020-10-16 05:01:56,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:01:56,541 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:56,541 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:56,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:01:56,542 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1062479201, now seen corresponding path program 1 times [2020-10-16 05:01:56,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:56,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966349581] [2020-10-16 05:01:56,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:56,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966349581] [2020-10-16 05:01:56,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:56,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:56,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905469585] [2020-10-16 05:01:56,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:56,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:56,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:56,815 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 167 [2020-10-16 05:01:56,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 727 flow. Second operand 7 states. [2020-10-16 05:01:56,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:56,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 167 [2020-10-16 05:01:56,816 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:57,279 INFO L129 PetriNetUnfolder]: 211/453 cut-off events. [2020-10-16 05:01:57,279 INFO L130 PetriNetUnfolder]: For 2607/2668 co-relation queries the response was YES. [2020-10-16 05:01:57,283 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 453 events. 211/453 cut-off events. For 2607/2668 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2376 event pairs, 53 based on Foata normal form. 27/476 useless extension candidates. Maximal degree in co-relation 2334. Up to 308 conditions per place. [2020-10-16 05:01:57,288 INFO L132 encePairwiseOnDemand]: 160/167 looper letters, 41 selfloop transitions, 27 changer transitions 7/88 dead transitions. [2020-10-16 05:01:57,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 1028 flow [2020-10-16 05:01:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:01:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:01:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2020-10-16 05:01:57,293 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6414670658682635 [2020-10-16 05:01:57,293 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2020-10-16 05:01:57,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2020-10-16 05:01:57,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:57,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2020-10-16 05:01:57,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:01:57,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:01:57,299 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:01:57,299 INFO L185 Difference]: Start difference. First operand has 77 places, 75 transitions, 727 flow. Second operand 8 states and 857 transitions. [2020-10-16 05:01:57,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 1028 flow [2020-10-16 05:01:57,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 952 flow, removed 26 selfloop flow, removed 5 redundant places. [2020-10-16 05:01:57,312 INFO L241 Difference]: Finished difference. Result has 81 places, 77 transitions, 781 flow [2020-10-16 05:01:57,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=781, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2020-10-16 05:01:57,313 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2020-10-16 05:01:57,313 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 781 flow [2020-10-16 05:01:57,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:57,313 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:57,313 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:57,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:01:57,314 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1655669207, now seen corresponding path program 1 times [2020-10-16 05:01:57,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:57,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579679675] [2020-10-16 05:01:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:57,562 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 05:01:57,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579679675] [2020-10-16 05:01:57,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:57,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:01:57,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433173298] [2020-10-16 05:01:57,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:01:57,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:01:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:01:57,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2020-10-16 05:01:57,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 781 flow. Second operand 8 states. [2020-10-16 05:01:57,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:57,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2020-10-16 05:01:57,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:58,100 INFO L129 PetriNetUnfolder]: 229/499 cut-off events. [2020-10-16 05:01:58,100 INFO L130 PetriNetUnfolder]: For 2660/2722 co-relation queries the response was YES. [2020-10-16 05:01:58,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 499 events. 229/499 cut-off events. For 2660/2722 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2748 event pairs, 16 based on Foata normal form. 30/526 useless extension candidates. Maximal degree in co-relation 2468. Up to 219 conditions per place. [2020-10-16 05:01:58,107 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 44 selfloop transitions, 33 changer transitions 6/96 dead transitions. [2020-10-16 05:01:58,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 1118 flow [2020-10-16 05:01:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:01:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:01:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 955 transitions. [2020-10-16 05:01:58,111 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.635395874916833 [2020-10-16 05:01:58,111 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 955 transitions. [2020-10-16 05:01:58,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 955 transitions. [2020-10-16 05:01:58,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:58,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 955 transitions. [2020-10-16 05:01:58,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:01:58,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:01:58,116 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:01:58,116 INFO L185 Difference]: Start difference. First operand has 81 places, 77 transitions, 781 flow. Second operand 9 states and 955 transitions. [2020-10-16 05:01:58,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 1118 flow [2020-10-16 05:01:58,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 96 transitions, 1060 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 05:01:58,126 INFO L241 Difference]: Finished difference. Result has 84 places, 84 transitions, 894 flow [2020-10-16 05:01:58,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=894, PETRI_PLACES=84, PETRI_TRANSITIONS=84} [2020-10-16 05:01:58,126 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2020-10-16 05:01:58,127 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 84 transitions, 894 flow [2020-10-16 05:01:58,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:01:58,127 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:58,127 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:58,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:01:58,127 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 30828136, now seen corresponding path program 1 times [2020-10-16 05:01:58,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:58,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138300714] [2020-10-16 05:01:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:58,513 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 05:01:58,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138300714] [2020-10-16 05:01:58,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:58,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:01:58,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555977860] [2020-10-16 05:01:58,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:01:58,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:01:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:01:58,516 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2020-10-16 05:01:58,517 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 894 flow. Second operand 9 states. [2020-10-16 05:01:58,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:58,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2020-10-16 05:01:58,518 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:59,299 INFO L129 PetriNetUnfolder]: 265/584 cut-off events. [2020-10-16 05:01:59,299 INFO L130 PetriNetUnfolder]: For 3706/3775 co-relation queries the response was YES. [2020-10-16 05:01:59,303 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 584 events. 265/584 cut-off events. For 3706/3775 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3381 event pairs, 45 based on Foata normal form. 45/627 useless extension candidates. Maximal degree in co-relation 3118. Up to 300 conditions per place. [2020-10-16 05:01:59,310 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 51 selfloop transitions, 43 changer transitions 19/126 dead transitions. [2020-10-16 05:01:59,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 126 transitions, 1562 flow [2020-10-16 05:01:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:01:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:01:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1285 transitions. [2020-10-16 05:01:59,316 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6412175648702595 [2020-10-16 05:01:59,317 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1285 transitions. [2020-10-16 05:01:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1285 transitions. [2020-10-16 05:01:59,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:59,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1285 transitions. [2020-10-16 05:01:59,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:01:59,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:01:59,326 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:01:59,327 INFO L185 Difference]: Start difference. First operand has 84 places, 84 transitions, 894 flow. Second operand 12 states and 1285 transitions. [2020-10-16 05:01:59,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 126 transitions, 1562 flow [2020-10-16 05:01:59,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1522 flow, removed 17 selfloop flow, removed 4 redundant places. [2020-10-16 05:01:59,349 INFO L241 Difference]: Finished difference. Result has 96 places, 92 transitions, 1086 flow [2020-10-16 05:01:59,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1086, PETRI_PLACES=96, PETRI_TRANSITIONS=92} [2020-10-16 05:01:59,350 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 62 predicate places. [2020-10-16 05:01:59,350 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 92 transitions, 1086 flow [2020-10-16 05:01:59,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:01:59,351 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:59,351 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:59,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:01:59,351 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1467325475, now seen corresponding path program 2 times [2020-10-16 05:01:59,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:59,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721586603] [2020-10-16 05:01:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:59,583 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 05:01:59,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721586603] [2020-10-16 05:01:59,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:59,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:01:59,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382824334] [2020-10-16 05:01:59,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:01:59,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:01:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:01:59,588 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 167 [2020-10-16 05:01:59,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 92 transitions, 1086 flow. Second operand 9 states. [2020-10-16 05:01:59,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:59,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 167 [2020-10-16 05:01:59,589 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:00,207 INFO L129 PetriNetUnfolder]: 229/530 cut-off events. [2020-10-16 05:02:00,207 INFO L130 PetriNetUnfolder]: For 3760/3827 co-relation queries the response was YES. [2020-10-16 05:02:00,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3035 conditions, 530 events. 229/530 cut-off events. For 3760/3827 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3195 event pairs, 31 based on Foata normal form. 41/568 useless extension candidates. Maximal degree in co-relation 2991. Up to 318 conditions per place. [2020-10-16 05:02:00,214 INFO L132 encePairwiseOnDemand]: 157/167 looper letters, 44 selfloop transitions, 53 changer transitions 6/116 dead transitions. [2020-10-16 05:02:00,215 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 116 transitions, 1541 flow [2020-10-16 05:02:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:02:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:02:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1325 transitions. [2020-10-16 05:02:00,219 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6611776447105788 [2020-10-16 05:02:00,219 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1325 transitions. [2020-10-16 05:02:00,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1325 transitions. [2020-10-16 05:02:00,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:00,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1325 transitions. [2020-10-16 05:02:00,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:02:00,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:02:00,225 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:02:00,225 INFO L185 Difference]: Start difference. First operand has 96 places, 92 transitions, 1086 flow. Second operand 12 states and 1325 transitions. [2020-10-16 05:02:00,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 116 transitions, 1541 flow [2020-10-16 05:02:00,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 116 transitions, 1470 flow, removed 22 selfloop flow, removed 6 redundant places. [2020-10-16 05:02:00,242 INFO L241 Difference]: Finished difference. Result has 103 places, 103 transitions, 1302 flow [2020-10-16 05:02:00,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1302, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2020-10-16 05:02:00,242 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 69 predicate places. [2020-10-16 05:02:00,243 INFO L481 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 1302 flow [2020-10-16 05:02:00,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:02:00,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:00,243 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:00,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:02:00,243 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1833057716, now seen corresponding path program 2 times [2020-10-16 05:02:00,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:00,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240358002] [2020-10-16 05:02:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:00,663 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2020-10-16 05:02:00,817 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2020-10-16 05:02:00,965 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-10-16 05:02:01,008 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 05:02:01,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240358002] [2020-10-16 05:02:01,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:01,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:02:01,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365612688] [2020-10-16 05:02:01,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:02:01,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:02:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:02:01,014 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 167 [2020-10-16 05:02:01,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 1302 flow. Second operand 10 states. [2020-10-16 05:02:01,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:01,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 167 [2020-10-16 05:02:01,016 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:01,772 INFO L129 PetriNetUnfolder]: 220/510 cut-off events. [2020-10-16 05:02:01,772 INFO L130 PetriNetUnfolder]: For 4329/4400 co-relation queries the response was YES. [2020-10-16 05:02:01,775 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 510 events. 220/510 cut-off events. For 4329/4400 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3038 event pairs, 46 based on Foata normal form. 42/549 useless extension candidates. Maximal degree in co-relation 3035. Up to 304 conditions per place. [2020-10-16 05:02:01,779 INFO L132 encePairwiseOnDemand]: 159/167 looper letters, 49 selfloop transitions, 34 changer transitions 24/120 dead transitions. [2020-10-16 05:02:01,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 120 transitions, 1694 flow [2020-10-16 05:02:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:02:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:02:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1044 transitions. [2020-10-16 05:02:01,782 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6251497005988024 [2020-10-16 05:02:01,782 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1044 transitions. [2020-10-16 05:02:01,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1044 transitions. [2020-10-16 05:02:01,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:01,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1044 transitions. [2020-10-16 05:02:01,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:02:01,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:02:01,787 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:02:01,787 INFO L185 Difference]: Start difference. First operand has 103 places, 103 transitions, 1302 flow. Second operand 10 states and 1044 transitions. [2020-10-16 05:02:01,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 120 transitions, 1694 flow [2020-10-16 05:02:01,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 120 transitions, 1597 flow, removed 17 selfloop flow, removed 7 redundant places. [2020-10-16 05:02:01,807 INFO L241 Difference]: Finished difference. Result has 106 places, 93 transitions, 1187 flow [2020-10-16 05:02:01,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1187, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2020-10-16 05:02:01,808 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2020-10-16 05:02:01,808 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 1187 flow [2020-10-16 05:02:01,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:02:01,808 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:01,808 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:01,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:02:01,809 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:01,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:01,809 INFO L82 PathProgramCache]: Analyzing trace with hash 551499829, now seen corresponding path program 3 times [2020-10-16 05:02:01,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:01,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994579541] [2020-10-16 05:02:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:02,095 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 05:02:02,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994579541] [2020-10-16 05:02:02,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:02,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:02:02,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540830305] [2020-10-16 05:02:02,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:02:02,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:02:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:02:02,101 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 167 [2020-10-16 05:02:02,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 1187 flow. Second operand 9 states. [2020-10-16 05:02:02,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:02,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 167 [2020-10-16 05:02:02,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:02,596 INFO L129 PetriNetUnfolder]: 203/484 cut-off events. [2020-10-16 05:02:02,596 INFO L130 PetriNetUnfolder]: For 4012/4068 co-relation queries the response was YES. [2020-10-16 05:02:02,598 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2958 conditions, 484 events. 203/484 cut-off events. For 4012/4068 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2881 event pairs, 28 based on Foata normal form. 27/507 useless extension candidates. Maximal degree in co-relation 2912. Up to 209 conditions per place. [2020-10-16 05:02:02,602 INFO L132 encePairwiseOnDemand]: 156/167 looper letters, 57 selfloop transitions, 33 changer transitions 6/109 dead transitions. [2020-10-16 05:02:02,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 109 transitions, 1589 flow [2020-10-16 05:02:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:02:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:02:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1059 transitions. [2020-10-16 05:02:02,604 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6341317365269461 [2020-10-16 05:02:02,605 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1059 transitions. [2020-10-16 05:02:02,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1059 transitions. [2020-10-16 05:02:02,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:02,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1059 transitions. [2020-10-16 05:02:02,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:02:02,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:02:02,608 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:02:02,609 INFO L185 Difference]: Start difference. First operand has 106 places, 93 transitions, 1187 flow. Second operand 10 states and 1059 transitions. [2020-10-16 05:02:02,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 109 transitions, 1589 flow [2020-10-16 05:02:02,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 1453 flow, removed 7 selfloop flow, removed 14 redundant places. [2020-10-16 05:02:02,627 INFO L241 Difference]: Finished difference. Result has 101 places, 99 transitions, 1228 flow [2020-10-16 05:02:02,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1228, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2020-10-16 05:02:02,628 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 67 predicate places. [2020-10-16 05:02:02,628 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 1228 flow [2020-10-16 05:02:02,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:02:02,628 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:02,628 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:02,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:02:02,629 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1783950027, now seen corresponding path program 4 times [2020-10-16 05:02:02,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:02,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269455001] [2020-10-16 05:02:02,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:03,200 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 05:02:03,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269455001] [2020-10-16 05:02:03,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:03,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:02:03,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385655816] [2020-10-16 05:02:03,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:02:03,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:02:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:02:03,205 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 167 [2020-10-16 05:02:03,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 1228 flow. Second operand 10 states. [2020-10-16 05:02:03,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:03,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 167 [2020-10-16 05:02:03,207 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:04,201 INFO L129 PetriNetUnfolder]: 200/477 cut-off events. [2020-10-16 05:02:04,201 INFO L130 PetriNetUnfolder]: For 3806/3862 co-relation queries the response was YES. [2020-10-16 05:02:04,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2933 conditions, 477 events. 200/477 cut-off events. For 3806/3862 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2858 event pairs, 25 based on Foata normal form. 41/515 useless extension candidates. Maximal degree in co-relation 2890. Up to 288 conditions per place. [2020-10-16 05:02:04,211 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 50 selfloop transitions, 42 changer transitions 8/113 dead transitions. [2020-10-16 05:02:04,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 113 transitions, 1634 flow [2020-10-16 05:02:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:02:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:02:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1199 transitions. [2020-10-16 05:02:04,216 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6526946107784432 [2020-10-16 05:02:04,216 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1199 transitions. [2020-10-16 05:02:04,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1199 transitions. [2020-10-16 05:02:04,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:04,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1199 transitions. [2020-10-16 05:02:04,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:02:04,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:02:04,223 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:02:04,223 INFO L185 Difference]: Start difference. First operand has 101 places, 99 transitions, 1228 flow. Second operand 11 states and 1199 transitions. [2020-10-16 05:02:04,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 113 transitions, 1634 flow [2020-10-16 05:02:04,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 113 transitions, 1570 flow, removed 16 selfloop flow, removed 5 redundant places. [2020-10-16 05:02:04,257 INFO L241 Difference]: Finished difference. Result has 108 places, 102 transitions, 1347 flow [2020-10-16 05:02:04,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1347, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2020-10-16 05:02:04,257 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 74 predicate places. [2020-10-16 05:02:04,258 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 1347 flow [2020-10-16 05:02:04,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:02:04,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:04,258 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:04,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:02:04,259 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:04,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 666814005, now seen corresponding path program 1 times [2020-10-16 05:02:04,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:04,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035467130] [2020-10-16 05:02:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:04,404 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 05:02:04,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035467130] [2020-10-16 05:02:04,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:04,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:02:04,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247719242] [2020-10-16 05:02:04,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:02:04,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:04,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:02:04,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:02:04,408 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 167 [2020-10-16 05:02:04,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 1347 flow. Second operand 4 states. [2020-10-16 05:02:04,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:04,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 167 [2020-10-16 05:02:04,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:04,599 INFO L129 PetriNetUnfolder]: 294/711 cut-off events. [2020-10-16 05:02:04,599 INFO L130 PetriNetUnfolder]: For 6003/6124 co-relation queries the response was YES. [2020-10-16 05:02:04,605 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 711 events. 294/711 cut-off events. For 6003/6124 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 4888 event pairs, 73 based on Foata normal form. 137/816 useless extension candidates. Maximal degree in co-relation 3222. Up to 323 conditions per place. [2020-10-16 05:02:04,609 INFO L132 encePairwiseOnDemand]: 161/167 looper letters, 10 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2020-10-16 05:02:04,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 93 transitions, 1123 flow [2020-10-16 05:02:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:02:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:02:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 05:02:04,611 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.829940119760479 [2020-10-16 05:02:04,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 05:02:04,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 05:02:04,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:04,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 05:02:04,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:02:04,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:02:04,615 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:02:04,616 INFO L185 Difference]: Start difference. First operand has 108 places, 102 transitions, 1347 flow. Second operand 5 states and 693 transitions. [2020-10-16 05:02:04,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 93 transitions, 1123 flow [2020-10-16 05:02:04,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 1014 flow, removed 19 selfloop flow, removed 14 redundant places. [2020-10-16 05:02:04,637 INFO L241 Difference]: Finished difference. Result has 99 places, 90 transitions, 1026 flow [2020-10-16 05:02:04,637 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1026, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2020-10-16 05:02:04,637 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2020-10-16 05:02:04,637 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 1026 flow [2020-10-16 05:02:04,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:02:04,638 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:04,638 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:04,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:02:04,639 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1732676265, now seen corresponding path program 1 times [2020-10-16 05:02:04,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:04,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852676104] [2020-10-16 05:02:04,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:04,761 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 05:02:04,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852676104] [2020-10-16 05:02:04,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:04,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:02:04,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031203982] [2020-10-16 05:02:04,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:02:04,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:02:04,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:02:04,765 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 167 [2020-10-16 05:02:04,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 1026 flow. Second operand 5 states. [2020-10-16 05:02:04,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:04,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 167 [2020-10-16 05:02:04,765 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:04,963 INFO L129 PetriNetUnfolder]: 154/490 cut-off events. [2020-10-16 05:02:04,963 INFO L130 PetriNetUnfolder]: For 3457/3998 co-relation queries the response was YES. [2020-10-16 05:02:04,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 490 events. 154/490 cut-off events. For 3457/3998 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3532 event pairs, 9 based on Foata normal form. 321/795 useless extension candidates. Maximal degree in co-relation 2418. Up to 246 conditions per place. [2020-10-16 05:02:04,973 INFO L132 encePairwiseOnDemand]: 161/167 looper letters, 6 selfloop transitions, 15 changer transitions 3/96 dead transitions. [2020-10-16 05:02:04,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 96 transitions, 1084 flow [2020-10-16 05:02:04,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:02:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:02:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2020-10-16 05:02:04,977 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8297690333618477 [2020-10-16 05:02:04,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2020-10-16 05:02:04,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2020-10-16 05:02:04,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:04,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2020-10-16 05:02:04,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:02:04,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:02:04,982 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:02:04,982 INFO L185 Difference]: Start difference. First operand has 99 places, 90 transitions, 1026 flow. Second operand 7 states and 970 transitions. [2020-10-16 05:02:04,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 96 transitions, 1084 flow [2020-10-16 05:02:05,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 1030 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 05:02:05,004 INFO L241 Difference]: Finished difference. Result has 102 places, 93 transitions, 1027 flow [2020-10-16 05:02:05,004 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1027, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2020-10-16 05:02:05,004 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 68 predicate places. [2020-10-16 05:02:05,004 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 1027 flow [2020-10-16 05:02:05,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:02:05,005 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:05,005 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:05,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:02:05,005 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1538917677, now seen corresponding path program 1 times [2020-10-16 05:02:05,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:05,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391112349] [2020-10-16 05:02:05,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:05,245 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 05:02:05,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391112349] [2020-10-16 05:02:05,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:05,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:02:05,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490633570] [2020-10-16 05:02:05,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:02:05,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:02:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:02:05,251 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 167 [2020-10-16 05:02:05,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 1027 flow. Second operand 7 states. [2020-10-16 05:02:05,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:05,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 167 [2020-10-16 05:02:05,252 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:05,703 INFO L129 PetriNetUnfolder]: 194/608 cut-off events. [2020-10-16 05:02:05,703 INFO L130 PetriNetUnfolder]: For 4832/5425 co-relation queries the response was YES. [2020-10-16 05:02:05,706 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 608 events. 194/608 cut-off events. For 4832/5425 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4649 event pairs, 10 based on Foata normal form. 96/678 useless extension candidates. Maximal degree in co-relation 3371. Up to 323 conditions per place. [2020-10-16 05:02:05,709 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 22 selfloop transitions, 31 changer transitions 22/102 dead transitions. [2020-10-16 05:02:05,709 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 1310 flow [2020-10-16 05:02:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:02:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:02:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1075 transitions. [2020-10-16 05:02:05,711 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6437125748502994 [2020-10-16 05:02:05,712 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1075 transitions. [2020-10-16 05:02:05,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1075 transitions. [2020-10-16 05:02:05,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:05,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1075 transitions. [2020-10-16 05:02:05,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:02:05,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:02:05,715 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:02:05,716 INFO L185 Difference]: Start difference. First operand has 102 places, 93 transitions, 1027 flow. Second operand 10 states and 1075 transitions. [2020-10-16 05:02:05,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 1310 flow [2020-10-16 05:02:05,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 1271 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 05:02:05,740 INFO L241 Difference]: Finished difference. Result has 112 places, 79 transitions, 903 flow [2020-10-16 05:02:05,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=903, PETRI_PLACES=112, PETRI_TRANSITIONS=79} [2020-10-16 05:02:05,740 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2020-10-16 05:02:05,740 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 79 transitions, 903 flow [2020-10-16 05:02:05,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:02:05,741 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:05,741 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:05,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:02:05,741 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1030104177, now seen corresponding path program 2 times [2020-10-16 05:02:05,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:05,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425099121] [2020-10-16 05:02:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:06,224 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 05:02:06,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425099121] [2020-10-16 05:02:06,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:06,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:02:06,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184723670] [2020-10-16 05:02:06,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:02:06,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:02:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:02:06,228 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 167 [2020-10-16 05:02:06,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 79 transitions, 903 flow. Second operand 10 states. [2020-10-16 05:02:06,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:06,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 167 [2020-10-16 05:02:06,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:07,021 INFO L129 PetriNetUnfolder]: 199/618 cut-off events. [2020-10-16 05:02:07,021 INFO L130 PetriNetUnfolder]: For 4690/4901 co-relation queries the response was YES. [2020-10-16 05:02:07,025 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 618 events. 199/618 cut-off events. For 4690/4901 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 4704 event pairs, 12 based on Foata normal form. 91/681 useless extension candidates. Maximal degree in co-relation 3090. Up to 167 conditions per place. [2020-10-16 05:02:07,035 INFO L132 encePairwiseOnDemand]: 158/167 looper letters, 10 selfloop transitions, 15 changer transitions 37/87 dead transitions. [2020-10-16 05:02:07,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 87 transitions, 1159 flow [2020-10-16 05:02:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:02:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:02:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1350 transitions. [2020-10-16 05:02:07,037 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6218332565637955 [2020-10-16 05:02:07,038 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1350 transitions. [2020-10-16 05:02:07,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1350 transitions. [2020-10-16 05:02:07,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:07,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1350 transitions. [2020-10-16 05:02:07,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:02:07,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:02:07,048 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:02:07,048 INFO L185 Difference]: Start difference. First operand has 112 places, 79 transitions, 903 flow. Second operand 13 states and 1350 transitions. [2020-10-16 05:02:07,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 87 transitions, 1159 flow [2020-10-16 05:02:07,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 87 transitions, 1060 flow, removed 29 selfloop flow, removed 13 redundant places. [2020-10-16 05:02:07,069 INFO L241 Difference]: Finished difference. Result has 111 places, 49 transitions, 507 flow [2020-10-16 05:02:07,069 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=507, PETRI_PLACES=111, PETRI_TRANSITIONS=49} [2020-10-16 05:02:07,070 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 77 predicate places. [2020-10-16 05:02:07,070 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 49 transitions, 507 flow [2020-10-16 05:02:07,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:02:07,070 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:07,070 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:07,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:02:07,070 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -612191667, now seen corresponding path program 1 times [2020-10-16 05:02:07,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:07,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969754824] [2020-10-16 05:02:07,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:02:07,181 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 05:02:07,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969754824] [2020-10-16 05:02:07,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:02:07,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:02:07,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271635168] [2020-10-16 05:02:07,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:02:07,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:02:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:02:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:02:07,189 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 167 [2020-10-16 05:02:07,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 49 transitions, 507 flow. Second operand 6 states. [2020-10-16 05:02:07,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:02:07,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 167 [2020-10-16 05:02:07,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:02:07,303 INFO L129 PetriNetUnfolder]: 30/111 cut-off events. [2020-10-16 05:02:07,303 INFO L130 PetriNetUnfolder]: For 652/762 co-relation queries the response was YES. [2020-10-16 05:02:07,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 111 events. 30/111 cut-off events. For 652/762 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 472 event pairs, 0 based on Foata normal form. 69/176 useless extension candidates. Maximal degree in co-relation 553. Up to 30 conditions per place. [2020-10-16 05:02:07,306 INFO L132 encePairwiseOnDemand]: 161/167 looper letters, 2 selfloop transitions, 19 changer transitions 3/53 dead transitions. [2020-10-16 05:02:07,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 53 transitions, 585 flow [2020-10-16 05:02:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:02:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:02:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2020-10-16 05:02:07,310 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8256819693945442 [2020-10-16 05:02:07,310 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1241 transitions. [2020-10-16 05:02:07,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1241 transitions. [2020-10-16 05:02:07,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:02:07,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1241 transitions. [2020-10-16 05:02:07,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:02:07,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:02:07,314 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:02:07,315 INFO L185 Difference]: Start difference. First operand has 111 places, 49 transitions, 507 flow. Second operand 9 states and 1241 transitions. [2020-10-16 05:02:07,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 53 transitions, 585 flow [2020-10-16 05:02:07,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 53 transitions, 411 flow, removed 38 selfloop flow, removed 32 redundant places. [2020-10-16 05:02:07,321 INFO L241 Difference]: Finished difference. Result has 75 places, 50 transitions, 394 flow [2020-10-16 05:02:07,321 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2020-10-16 05:02:07,321 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2020-10-16 05:02:07,321 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 394 flow [2020-10-16 05:02:07,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:02:07,322 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:02:07,322 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:02:07,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 05:02:07,322 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:02:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:02:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1615693616, now seen corresponding path program 1 times [2020-10-16 05:02:07,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:02:07,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946476332] [2020-10-16 05:02:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:02:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:02:07,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:02:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:02:07,502 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:02:07,558 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:02:07,558 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:02:07,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 05:02:07,594 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 05:02:07,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,604 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 05:02:07,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,604 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 05:02:07,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,606 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 05:02:07,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,607 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 05:02:07,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,607 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 05:02:07,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,608 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 05:02:07,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,609 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 05:02:07,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,610 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 05:02:07,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,610 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 05:02:07,610 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,611 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 05:02:07,611 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,612 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 05:02:07,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,612 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 05:02:07,612 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,613 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 05:02:07,613 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,613 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 05:02:07,613 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,614 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 05:02:07,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,614 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 05:02:07,614 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,615 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 05:02:07,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,615 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 05:02:07,615 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,621 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 05:02:07,621 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,622 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 05:02:07,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,623 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 05:02:07,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,623 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 05:02:07,623 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,624 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 05:02:07,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,624 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 05:02:07,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,624 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 05:02:07,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,625 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 05:02:07,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,625 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 05:02:07,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,626 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 05:02:07,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,626 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 05:02:07,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,627 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 05:02:07,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,627 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 05:02:07,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,628 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 05:02:07,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,628 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 05:02:07,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,629 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 05:02:07,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,630 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 05:02:07,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,630 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 05:02:07,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,631 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 05:02:07,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,631 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 05:02:07,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,631 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 05:02:07,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,632 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 05:02:07,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,632 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 05:02:07,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,633 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 05:02:07,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,633 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 05:02:07,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,634 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 05:02:07,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,634 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 05:02:07,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,635 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 05:02:07,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,635 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 05:02:07,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,637 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 05:02:07,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,637 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 05:02:07,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,638 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 05:02:07,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,638 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 05:02:07,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,638 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 05:02:07,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,639 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 05:02:07,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,639 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 05:02:07,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,640 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 05:02:07,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,640 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 05:02:07,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,641 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 05:02:07,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,641 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 05:02:07,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,642 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 05:02:07,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,642 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 05:02:07,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,643 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 05:02:07,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,643 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 05:02:07,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,644 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 05:02:07,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,644 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 05:02:07,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,645 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 05:02:07,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,645 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 05:02:07,645 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:02:07,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:02:07 BasicIcfg [2020-10-16 05:02:07,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:02:07,757 INFO L168 Benchmark]: Toolchain (without parser) took 28186.26 ms. Allocated memory was 244.8 MB in the beginning and 883.4 MB in the end (delta: 638.6 MB). Free memory was 200.2 MB in the beginning and 593.1 MB in the end (delta: -392.9 MB). Peak memory consumption was 245.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,758 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:02:07,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.06 ms. Allocated memory was 244.8 MB in the beginning and 293.1 MB in the end (delta: 48.2 MB). Free memory was 200.2 MB in the beginning and 238.8 MB in the end (delta: -38.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.20 ms. Allocated memory is still 293.1 MB. Free memory was 238.8 MB in the beginning and 236.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,760 INFO L168 Benchmark]: Boogie Preprocessor took 47.25 ms. Allocated memory is still 293.1 MB. Free memory was 236.3 MB in the beginning and 233.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,761 INFO L168 Benchmark]: RCFGBuilder took 3107.81 ms. Allocated memory was 293.1 MB in the beginning and 361.8 MB in the end (delta: 68.7 MB). Free memory was 233.8 MB in the beginning and 163.0 MB in the end (delta: 70.8 MB). Peak memory consumption was 156.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,761 INFO L168 Benchmark]: TraceAbstraction took 24131.76 ms. Allocated memory was 361.8 MB in the beginning and 883.4 MB in the end (delta: 521.7 MB). Free memory was 163.0 MB in the beginning and 593.1 MB in the end (delta: -430.2 MB). Peak memory consumption was 91.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:02:07,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 244.8 MB. Free memory is still 221.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 826.06 ms. Allocated memory was 244.8 MB in the beginning and 293.1 MB in the end (delta: 48.2 MB). Free memory was 200.2 MB in the beginning and 238.8 MB in the end (delta: -38.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.20 ms. Allocated memory is still 293.1 MB. Free memory was 238.8 MB in the beginning and 236.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.25 ms. Allocated memory is still 293.1 MB. Free memory was 236.3 MB in the beginning and 233.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3107.81 ms. Allocated memory was 293.1 MB in the beginning and 361.8 MB in the end (delta: 68.7 MB). Free memory was 233.8 MB in the beginning and 163.0 MB in the end (delta: 70.8 MB). Peak memory consumption was 156.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 24131.76 ms. Allocated memory was 361.8 MB in the beginning and 883.4 MB in the end (delta: 521.7 MB). Free memory was 163.0 MB in the beginning and 593.1 MB in the end (delta: -430.2 MB). Peak memory consumption was 91.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 994 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 112 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4298 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L709] 0 _Bool y$flush_delayed; [L710] 0 int y$mem_tmp; [L711] 0 _Bool y$r_buff0_thd0; [L712] 0 _Bool y$r_buff0_thd1; [L713] 0 _Bool y$r_buff0_thd2; [L714] 0 _Bool y$r_buff0_thd3; [L715] 0 _Bool y$r_buff1_thd0; [L716] 0 _Bool y$r_buff1_thd1; [L717] 0 _Bool y$r_buff1_thd2; [L718] 0 _Bool y$r_buff1_thd3; [L719] 0 _Bool y$read_delayed; [L720] 0 int *y$read_delayed_var; [L721] 0 int y$w_buff0; [L722] 0 _Bool y$w_buff0_used; [L723] 0 int y$w_buff1; [L724] 0 _Bool y$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1873; [L834] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$w_buff1 = y$w_buff0 [L731] 1 y$w_buff0 = 2 [L732] 1 y$w_buff1_used = y$w_buff0_used [L733] 1 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L735] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L736] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L737] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L738] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L739] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1874; [L836] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L837] 0 pthread_t t1875; [L838] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 3 y$flush_delayed = weak$$choice2 [L782] 3 y$mem_tmp = y [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L783] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L783] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L784] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L784] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1 [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L785] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L785] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L786] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L786] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L786] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L786] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L787] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L788] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 __unbuffered_p2_EAX = y [L791] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L791] 3 y = y$flush_delayed ? y$mem_tmp : y [L792] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 y$flush_delayed = weak$$choice2 [L798] 3 y$mem_tmp = y [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L799] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L800] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L800] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L800] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L801] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L802] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L802] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L803] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L804] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L804] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EBX = y [L807] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L807] 3 y = y$flush_delayed ? y$mem_tmp : y [L808] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L749] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L856] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L857] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L859] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L860] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L863] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 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: 23.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 125 SDtfs, 126 SDslu, 165 SDs, 0 SdLazy, 1430 SolverSat, 537 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1347occurred in iteration=18, 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.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 74119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...