/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:42:45,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:42:45,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:42:45,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:42:45,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:42:45,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:42:45,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:42:45,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:42:45,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:42:45,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:42:45,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:42:45,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:42:45,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:42:45,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:42:45,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:42:45,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:42:45,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:42:45,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:42:45,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:42:45,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:42:45,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:42:45,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:42:45,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:42:45,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:42:45,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:42:45,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:42:45,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:42:45,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:42:45,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:42:45,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:42:45,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:42:45,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:42:45,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:42:45,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:42:45,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:42:45,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:42:45,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:42:45,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:42:45,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:42:45,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:42:45,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:42:45,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:42:45,188 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:42:45,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:42:45,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:42:45,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:42:45,190 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:42:45,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:42:45,191 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:42:45,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:42:45,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:42:45,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:42:45,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:42:45,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:42:45,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:42:45,193 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:42:45,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:42:45,193 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:42:45,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:42:45,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:42:45,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:42:45,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:42:45,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:42:45,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:42:45,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:42:45,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:42:45,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:42:45,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:42:45,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:42:45,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:42:45,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:42:45,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:42:45,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:42:45,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:42:45,523 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:42:45,523 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:42:45,524 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-16 01:42:45,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef1f371d/abce29c813e040c48d458dcb0ea51be5/FLAGce7cc8244 [2020-10-16 01:42:46,181 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:42:46,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-16 01:42:46,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef1f371d/abce29c813e040c48d458dcb0ea51be5/FLAGce7cc8244 [2020-10-16 01:42:46,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef1f371d/abce29c813e040c48d458dcb0ea51be5 [2020-10-16 01:42:46,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:42:46,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:42:46,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:42:46,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:42:46,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:42:46,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:42:46" (1/1) ... [2020-10-16 01:42:46,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e9e907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:46, skipping insertion in model container [2020-10-16 01:42:46,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:42:46" (1/1) ... [2020-10-16 01:42:46,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:42:46,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:42:47,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:42:47,033 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:42:47,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:42:47,208 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:42:47,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47 WrapperNode [2020-10-16 01:42:47,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:42:47,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:42:47,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:42:47,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:42:47,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:42:47,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:42:47,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:42:47,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:42:47,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... [2020-10-16 01:42:47,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:42:47,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:42:47,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:42:47,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:42:47,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:42:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:42:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:42:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:42:47,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:42:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:42:47,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:42:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:42:47,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:42:47,428 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:42:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:42:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:42:47,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:42:47,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:42:47,431 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:42:51,318 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:42:51,319 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:42:51,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:42:51 BoogieIcfgContainer [2020-10-16 01:42:51,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:42:51,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:42:51,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:42:51,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:42:51,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:42:46" (1/3) ... [2020-10-16 01:42:51,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454365ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:42:51, skipping insertion in model container [2020-10-16 01:42:51,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:42:47" (2/3) ... [2020-10-16 01:42:51,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454365ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:42:51, skipping insertion in model container [2020-10-16 01:42:51,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:42:51" (3/3) ... [2020-10-16 01:42:51,337 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2020-10-16 01:42:51,350 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:42:51,360 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:42:51,361 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:42:51,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:42:51,497 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:42:51,523 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:42:51,523 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:42:51,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:42:51,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:42:51,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:42:51,523 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:42:51,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:42:51,524 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:42:51,543 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 01:42:51,614 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 01:42:51,614 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:51,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:42:51,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 01:42:51,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:51,634 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:42:51,637 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:51,640 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:51,641 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 01:42:51,678 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 01:42:51,679 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:51,684 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 01:42:51,688 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 01:42:51,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:51,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:51,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:51,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:51,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:51,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:51,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:52,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,249 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 01:42:52,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:52,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:52,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:52,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:52,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:52,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:52,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:52,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:52,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:52,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,012 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:42:53,186 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 01:42:53,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:53,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:53,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:53,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:53,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:53,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:53,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:53,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,763 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 01:42:53,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:53,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:53,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:53,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:53,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:53,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:53,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:53,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:53,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:42:53,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:54,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,563 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 01:42:54,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,564 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 01:42:54,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:54,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,657 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 01:42:54,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:42:54,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:54,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:42:54,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:42:54,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:42:54,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:42:54,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:54,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:54,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:42:54,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:42:54,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:42:54,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:42:54,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:54,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:42:54,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:55,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:55,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:55,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:55,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:55,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:42:55,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:55,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:42:55,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:42:55,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:55,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:42:55,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:42:55,798 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 01:42:55,923 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 01:42:55,932 INFO L132 LiptonReduction]: Checked pairs total: 5549 [2020-10-16 01:42:55,932 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 01:42:55,935 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4303 [2020-10-16 01:42:55,943 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 01:42:55,943 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:55,944 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:55,944 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:42:55,945 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:55,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-16 01:42:55,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:55,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377514085] [2020-10-16 01:42:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:56,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377514085] [2020-10-16 01:42:56,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:56,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:42:56,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651476426] [2020-10-16 01:42:56,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:42:56,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:42:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:42:56,262 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:42:56,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 01:42:56,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:56,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:42:56,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:56,483 INFO L129 PetriNetUnfolder]: 190/405 cut-off events. [2020-10-16 01:42:56,483 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:56,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 405 events. 190/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2152 event pairs, 104 based on Foata normal form. 33/403 useless extension candidates. Maximal degree in co-relation 704. Up to 223 conditions per place. [2020-10-16 01:42:56,490 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 01:42:56,490 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 105 flow [2020-10-16 01:42:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:42:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:42:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 01:42:56,509 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2020-10-16 01:42:56,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 01:42:56,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 01:42:56,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:56,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 01:42:56,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:42:56,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:42:56,532 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:42:56,534 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 440 transitions. [2020-10-16 01:42:56,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 105 flow [2020-10-16 01:42:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:42:56,541 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 01:42:56,544 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 01:42:56,545 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 01:42:56,545 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 01:42:56,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:42:56,545 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:56,545 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:56,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:42:56,546 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-16 01:42:56,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:56,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052571204] [2020-10-16 01:42:56,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:56,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 01:42:56,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052571204] [2020-10-16 01:42:56,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:56,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:42:56,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721789336] [2020-10-16 01:42:56,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:42:56,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:42:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:42:56,767 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 171 [2020-10-16 01:42:56,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states. [2020-10-16 01:42:56,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:56,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 171 [2020-10-16 01:42:56,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:56,816 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2020-10-16 01:42:56,817 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:42:56,817 INFO L80 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2020-10-16 01:42:56,818 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2020-10-16 01:42:56,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 84 flow [2020-10-16 01:42:56,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:42:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:42:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2020-10-16 01:42:56,822 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8198830409356725 [2020-10-16 01:42:56,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2020-10-16 01:42:56,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2020-10-16 01:42:56,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:56,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2020-10-16 01:42:56,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:42:56,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:42:56,828 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:42:56,829 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 701 transitions. [2020-10-16 01:42:56,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 84 flow [2020-10-16 01:42:56,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:42:56,830 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 64 flow [2020-10-16 01:42:56,831 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=64, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2020-10-16 01:42:56,831 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 01:42:56,831 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 64 flow [2020-10-16 01:42:56,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:42:56,832 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:56,832 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:56,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:42:56,832 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1859395228, now seen corresponding path program 1 times [2020-10-16 01:42:56,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:56,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975624784] [2020-10-16 01:42:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:57,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975624784] [2020-10-16 01:42:57,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:57,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:42:57,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377216346] [2020-10-16 01:42:57,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:42:57,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:42:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:42:57,008 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 171 [2020-10-16 01:42:57,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 64 flow. Second operand 5 states. [2020-10-16 01:42:57,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:57,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 171 [2020-10-16 01:42:57,009 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:57,138 INFO L129 PetriNetUnfolder]: 65/141 cut-off events. [2020-10-16 01:42:57,138 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 01:42:57,139 INFO L80 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 141 events. 65/141 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 594 event pairs, 42 based on Foata normal form. 12/150 useless extension candidates. Maximal degree in co-relation 289. Up to 81 conditions per place. [2020-10-16 01:42:57,141 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 5 changer transitions 11/41 dead transitions. [2020-10-16 01:42:57,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 156 flow [2020-10-16 01:42:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:42:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:42:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2020-10-16 01:42:57,145 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7669172932330827 [2020-10-16 01:42:57,145 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2020-10-16 01:42:57,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2020-10-16 01:42:57,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:57,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2020-10-16 01:42:57,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:42:57,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:42:57,151 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:42:57,151 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 64 flow. Second operand 7 states and 918 transitions. [2020-10-16 01:42:57,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 156 flow [2020-10-16 01:42:57,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 148 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:57,153 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 97 flow [2020-10-16 01:42:57,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2020-10-16 01:42:57,154 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 01:42:57,154 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 97 flow [2020-10-16 01:42:57,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:42:57,154 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:57,154 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:57,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:42:57,155 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash -447025861, now seen corresponding path program 1 times [2020-10-16 01:42:57,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:57,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476083350] [2020-10-16 01:42:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:57,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476083350] [2020-10-16 01:42:57,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:57,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:42:57,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665589532] [2020-10-16 01:42:57,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:42:57,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:42:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:42:57,402 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 171 [2020-10-16 01:42:57,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 97 flow. Second operand 6 states. [2020-10-16 01:42:57,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:57,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 171 [2020-10-16 01:42:57,403 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:57,592 INFO L129 PetriNetUnfolder]: 147/282 cut-off events. [2020-10-16 01:42:57,592 INFO L130 PetriNetUnfolder]: For 311/334 co-relation queries the response was YES. [2020-10-16 01:42:57,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 282 events. 147/282 cut-off events. For 311/334 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1237 event pairs, 25 based on Foata normal form. 13/289 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2020-10-16 01:42:57,596 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 15 selfloop transitions, 8 changer transitions 19/57 dead transitions. [2020-10-16 01:42:57,596 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 315 flow [2020-10-16 01:42:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:42:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:42:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1024 transitions. [2020-10-16 01:42:57,601 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7485380116959064 [2020-10-16 01:42:57,601 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1024 transitions. [2020-10-16 01:42:57,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1024 transitions. [2020-10-16 01:42:57,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:57,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1024 transitions. [2020-10-16 01:42:57,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:42:57,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:42:57,608 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:42:57,608 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 97 flow. Second operand 8 states and 1024 transitions. [2020-10-16 01:42:57,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 315 flow [2020-10-16 01:42:57,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 308 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 01:42:57,613 INFO L241 Difference]: Finished difference. Result has 49 places, 32 transitions, 182 flow [2020-10-16 01:42:57,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2020-10-16 01:42:57,614 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2020-10-16 01:42:57,614 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 182 flow [2020-10-16 01:42:57,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:42:57,615 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:57,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:57,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:42:57,615 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 685236403, now seen corresponding path program 1 times [2020-10-16 01:42:57,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:57,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406826294] [2020-10-16 01:42:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:57,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406826294] [2020-10-16 01:42:57,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:57,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:42:57,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000355801] [2020-10-16 01:42:57,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:42:57,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:42:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:42:57,897 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 01:42:57,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 182 flow. Second operand 9 states. [2020-10-16 01:42:57,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:57,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 01:42:57,897 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:58,658 INFO L129 PetriNetUnfolder]: 405/752 cut-off events. [2020-10-16 01:42:58,658 INFO L130 PetriNetUnfolder]: For 3172/3298 co-relation queries the response was YES. [2020-10-16 01:42:58,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 752 events. 405/752 cut-off events. For 3172/3298 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3917 event pairs, 138 based on Foata normal form. 61/776 useless extension candidates. Maximal degree in co-relation 2900. Up to 368 conditions per place. [2020-10-16 01:42:58,670 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 20 selfloop transitions, 14 changer transitions 17/70 dead transitions. [2020-10-16 01:42:58,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 400 flow [2020-10-16 01:42:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:42:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:42:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1124 transitions. [2020-10-16 01:42:58,676 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6573099415204678 [2020-10-16 01:42:58,676 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1124 transitions. [2020-10-16 01:42:58,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1124 transitions. [2020-10-16 01:42:58,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:58,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1124 transitions. [2020-10-16 01:42:58,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:42:58,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:42:58,684 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:42:58,684 INFO L185 Difference]: Start difference. First operand has 49 places, 32 transitions, 182 flow. Second operand 10 states and 1124 transitions. [2020-10-16 01:42:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 400 flow [2020-10-16 01:42:58,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 380 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:42:58,698 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 280 flow [2020-10-16 01:42:58,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2020-10-16 01:42:58,699 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2020-10-16 01:42:58,699 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 280 flow [2020-10-16 01:42:58,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:42:58,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:58,700 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:58,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:42:58,700 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -10837667, now seen corresponding path program 2 times [2020-10-16 01:42:58,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:58,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154346483] [2020-10-16 01:42:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:58,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154346483] [2020-10-16 01:42:58,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:58,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:42:58,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143850989] [2020-10-16 01:42:58,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:42:58,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:42:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:42:58,855 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 01:42:58,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 280 flow. Second operand 6 states. [2020-10-16 01:42:58,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:58,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 01:42:58,856 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:42:59,326 INFO L129 PetriNetUnfolder]: 432/795 cut-off events. [2020-10-16 01:42:59,326 INFO L130 PetriNetUnfolder]: For 5737/5942 co-relation queries the response was YES. [2020-10-16 01:42:59,333 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4013 conditions, 795 events. 432/795 cut-off events. For 5737/5942 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4173 event pairs, 153 based on Foata normal form. 61/824 useless extension candidates. Maximal degree in co-relation 3987. Up to 385 conditions per place. [2020-10-16 01:42:59,339 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 21 selfloop transitions, 20 changer transitions 9/69 dead transitions. [2020-10-16 01:42:59,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 550 flow [2020-10-16 01:42:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:42:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:42:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 911 transitions. [2020-10-16 01:42:59,344 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6659356725146199 [2020-10-16 01:42:59,344 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 911 transitions. [2020-10-16 01:42:59,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 911 transitions. [2020-10-16 01:42:59,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:42:59,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 911 transitions. [2020-10-16 01:42:59,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:42:59,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:42:59,349 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:42:59,350 INFO L185 Difference]: Start difference. First operand has 59 places, 44 transitions, 280 flow. Second operand 8 states and 911 transitions. [2020-10-16 01:42:59,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 550 flow [2020-10-16 01:42:59,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 518 flow, removed 16 selfloop flow, removed 4 redundant places. [2020-10-16 01:42:59,360 INFO L241 Difference]: Finished difference. Result has 62 places, 54 transitions, 425 flow [2020-10-16 01:42:59,360 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=425, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2020-10-16 01:42:59,361 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2020-10-16 01:42:59,361 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 425 flow [2020-10-16 01:42:59,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:42:59,361 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:42:59,361 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:42:59,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:42:59,361 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:42:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:42:59,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1524948681, now seen corresponding path program 1 times [2020-10-16 01:42:59,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:42:59,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064609006] [2020-10-16 01:42:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:42:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:42:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:42:59,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064609006] [2020-10-16 01:42:59,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:42:59,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:42:59,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629208166] [2020-10-16 01:42:59,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:42:59,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:42:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:42:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:42:59,776 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 01:42:59,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 425 flow. Second operand 9 states. [2020-10-16 01:42:59,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:42:59,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 01:42:59,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:00,359 INFO L129 PetriNetUnfolder]: 402/743 cut-off events. [2020-10-16 01:43:00,359 INFO L130 PetriNetUnfolder]: For 4384/4666 co-relation queries the response was YES. [2020-10-16 01:43:00,368 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 743 events. 402/743 cut-off events. For 4384/4666 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3831 event pairs, 124 based on Foata normal form. 56/765 useless extension candidates. Maximal degree in co-relation 3969. Up to 407 conditions per place. [2020-10-16 01:43:00,380 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 30 selfloop transitions, 14 changer transitions 6/69 dead transitions. [2020-10-16 01:43:00,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 665 flow [2020-10-16 01:43:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:43:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:43:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 793 transitions. [2020-10-16 01:43:00,386 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6624895572263994 [2020-10-16 01:43:00,386 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 793 transitions. [2020-10-16 01:43:00,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 793 transitions. [2020-10-16 01:43:00,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:00,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 793 transitions. [2020-10-16 01:43:00,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:43:00,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:43:00,395 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:43:00,395 INFO L185 Difference]: Start difference. First operand has 62 places, 54 transitions, 425 flow. Second operand 7 states and 793 transitions. [2020-10-16 01:43:00,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 665 flow [2020-10-16 01:43:00,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 638 flow, removed 13 selfloop flow, removed 2 redundant places. [2020-10-16 01:43:00,411 INFO L241 Difference]: Finished difference. Result has 67 places, 57 transitions, 494 flow [2020-10-16 01:43:00,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2020-10-16 01:43:00,412 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2020-10-16 01:43:00,412 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 494 flow [2020-10-16 01:43:00,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:00,413 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:00,413 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:00,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:43:00,413 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:00,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1768737579, now seen corresponding path program 1 times [2020-10-16 01:43:00,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:00,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238681925] [2020-10-16 01:43:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:00,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238681925] [2020-10-16 01:43:00,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:00,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:43:00,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738908857] [2020-10-16 01:43:00,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:43:00,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:00,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:43:00,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:43:00,594 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:43:00,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 494 flow. Second operand 4 states. [2020-10-16 01:43:00,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:00,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:43:00,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:00,823 INFO L129 PetriNetUnfolder]: 287/639 cut-off events. [2020-10-16 01:43:00,824 INFO L130 PetriNetUnfolder]: For 4432/4841 co-relation queries the response was YES. [2020-10-16 01:43:00,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 639 events. 287/639 cut-off events. For 4432/4841 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3991 event pairs, 91 based on Foata normal form. 80/674 useless extension candidates. Maximal degree in co-relation 3240. Up to 263 conditions per place. [2020-10-16 01:43:00,841 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 20 changer transitions 0/73 dead transitions. [2020-10-16 01:43:00,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 686 flow [2020-10-16 01:43:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:43:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:43:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2020-10-16 01:43:00,846 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-16 01:43:00,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2020-10-16 01:43:00,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2020-10-16 01:43:00,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:00,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2020-10-16 01:43:00,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:43:00,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:43:00,852 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:43:00,853 INFO L185 Difference]: Start difference. First operand has 67 places, 57 transitions, 494 flow. Second operand 5 states and 718 transitions. [2020-10-16 01:43:00,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 686 flow [2020-10-16 01:43:00,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 642 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-16 01:43:00,874 INFO L241 Difference]: Finished difference. Result has 65 places, 70 transitions, 644 flow [2020-10-16 01:43:00,874 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=644, PETRI_PLACES=65, PETRI_TRANSITIONS=70} [2020-10-16 01:43:00,874 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2020-10-16 01:43:00,875 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 70 transitions, 644 flow [2020-10-16 01:43:00,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:43:00,875 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:00,875 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:00,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:43:00,876 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1230725637, now seen corresponding path program 1 times [2020-10-16 01:43:00,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:00,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719792460] [2020-10-16 01:43:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:00,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719792460] [2020-10-16 01:43:00,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:00,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:43:00,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279466240] [2020-10-16 01:43:00,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:43:00,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:43:00,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:43:00,991 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2020-10-16 01:43:00,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 70 transitions, 644 flow. Second operand 5 states. [2020-10-16 01:43:00,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:00,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2020-10-16 01:43:00,992 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:01,204 INFO L129 PetriNetUnfolder]: 300/684 cut-off events. [2020-10-16 01:43:01,204 INFO L130 PetriNetUnfolder]: For 6022/6501 co-relation queries the response was YES. [2020-10-16 01:43:01,255 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 684 events. 300/684 cut-off events. For 6022/6501 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4461 event pairs, 116 based on Foata normal form. 54/690 useless extension candidates. Maximal degree in co-relation 3662. Up to 283 conditions per place. [2020-10-16 01:43:01,262 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 2 selfloop transitions, 5 changer transitions 5/74 dead transitions. [2020-10-16 01:43:01,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 716 flow [2020-10-16 01:43:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:43:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:43:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2020-10-16 01:43:01,265 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8060428849902534 [2020-10-16 01:43:01,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2020-10-16 01:43:01,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2020-10-16 01:43:01,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:01,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2020-10-16 01:43:01,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:43:01,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:43:01,270 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:43:01,270 INFO L185 Difference]: Start difference. First operand has 65 places, 70 transitions, 644 flow. Second operand 6 states and 827 transitions. [2020-10-16 01:43:01,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 716 flow [2020-10-16 01:43:01,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 686 flow, removed 10 selfloop flow, removed 1 redundant places. [2020-10-16 01:43:01,279 INFO L241 Difference]: Finished difference. Result has 73 places, 69 transitions, 632 flow [2020-10-16 01:43:01,280 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2020-10-16 01:43:01,280 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2020-10-16 01:43:01,280 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 632 flow [2020-10-16 01:43:01,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:43:01,280 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:01,280 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:01,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:43:01,281 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1598356183, now seen corresponding path program 1 times [2020-10-16 01:43:01,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:01,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908313503] [2020-10-16 01:43:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:01,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908313503] [2020-10-16 01:43:01,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:01,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:43:01,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241011261] [2020-10-16 01:43:01,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:43:01,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:43:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:43:01,384 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:43:01,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 632 flow. Second operand 5 states. [2020-10-16 01:43:01,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:01,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:43:01,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:01,543 INFO L129 PetriNetUnfolder]: 145/391 cut-off events. [2020-10-16 01:43:01,544 INFO L130 PetriNetUnfolder]: For 3729/4459 co-relation queries the response was YES. [2020-10-16 01:43:01,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 391 events. 145/391 cut-off events. For 3729/4459 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2368 event pairs, 15 based on Foata normal form. 217/591 useless extension candidates. Maximal degree in co-relation 2159. Up to 168 conditions per place. [2020-10-16 01:43:01,551 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 27 changer transitions 3/79 dead transitions. [2020-10-16 01:43:01,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 79 transitions, 832 flow [2020-10-16 01:43:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:43:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:43:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2020-10-16 01:43:01,556 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2020-10-16 01:43:01,556 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2020-10-16 01:43:01,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2020-10-16 01:43:01,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:01,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2020-10-16 01:43:01,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:43:01,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:43:01,565 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:43:01,565 INFO L185 Difference]: Start difference. First operand has 73 places, 69 transitions, 632 flow. Second operand 7 states and 1005 transitions. [2020-10-16 01:43:01,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 79 transitions, 832 flow [2020-10-16 01:43:01,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 79 transitions, 809 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:01,578 INFO L241 Difference]: Finished difference. Result has 74 places, 76 transitions, 792 flow [2020-10-16 01:43:01,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2020-10-16 01:43:01,579 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 39 predicate places. [2020-10-16 01:43:01,579 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 792 flow [2020-10-16 01:43:01,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:43:01,579 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:01,579 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 01:43:01,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:43:01,579 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash 636273372, now seen corresponding path program 1 times [2020-10-16 01:43:01,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:01,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817267106] [2020-10-16 01:43:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:01,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817267106] [2020-10-16 01:43:01,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:01,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:43:01,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662435673] [2020-10-16 01:43:01,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:43:01,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:01,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:43:01,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:43:01,735 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 01:43:01,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 792 flow. Second operand 6 states. [2020-10-16 01:43:01,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:01,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 01:43:01,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:01,907 INFO L129 PetriNetUnfolder]: 123/344 cut-off events. [2020-10-16 01:43:01,907 INFO L130 PetriNetUnfolder]: For 3789/4410 co-relation queries the response was YES. [2020-10-16 01:43:01,911 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 344 events. 123/344 cut-off events. For 3789/4410 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2137 event pairs, 5 based on Foata normal form. 172/501 useless extension candidates. Maximal degree in co-relation 2062. Up to 153 conditions per place. [2020-10-16 01:43:01,914 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 31 changer transitions 3/80 dead transitions. [2020-10-16 01:43:01,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 918 flow [2020-10-16 01:43:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:43:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:43:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2020-10-16 01:43:01,919 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356075373619233 [2020-10-16 01:43:01,920 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2020-10-16 01:43:01,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2020-10-16 01:43:01,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:01,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2020-10-16 01:43:01,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:43:01,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:43:01,928 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:43:01,928 INFO L185 Difference]: Start difference. First operand has 74 places, 76 transitions, 792 flow. Second operand 9 states and 1286 transitions. [2020-10-16 01:43:01,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 918 flow [2020-10-16 01:43:01,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 789 flow, removed 49 selfloop flow, removed 5 redundant places. [2020-10-16 01:43:01,948 INFO L241 Difference]: Finished difference. Result has 80 places, 77 transitions, 752 flow [2020-10-16 01:43:01,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=752, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2020-10-16 01:43:01,949 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2020-10-16 01:43:01,949 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 752 flow [2020-10-16 01:43:01,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:43:01,949 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:01,950 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:01,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:43:01,950 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1778065165, now seen corresponding path program 1 times [2020-10-16 01:43:01,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:01,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139147539] [2020-10-16 01:43:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:02,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139147539] [2020-10-16 01:43:02,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:02,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:43:02,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914060672] [2020-10-16 01:43:02,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:43:02,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:43:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:43:02,308 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 01:43:02,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 752 flow. Second operand 9 states. [2020-10-16 01:43:02,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:02,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 01:43:02,309 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:03,064 INFO L129 PetriNetUnfolder]: 311/879 cut-off events. [2020-10-16 01:43:03,064 INFO L130 PetriNetUnfolder]: For 7246/8037 co-relation queries the response was YES. [2020-10-16 01:43:03,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 879 events. 311/879 cut-off events. For 7246/8037 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7022 event pairs, 5 based on Foata normal form. 193/1035 useless extension candidates. Maximal degree in co-relation 4597. Up to 244 conditions per place. [2020-10-16 01:43:03,078 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 52 selfloop transitions, 17 changer transitions 22/131 dead transitions. [2020-10-16 01:43:03,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 131 transitions, 1379 flow [2020-10-16 01:43:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:43:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:43:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1093 transitions. [2020-10-16 01:43:03,083 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6391812865497076 [2020-10-16 01:43:03,084 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1093 transitions. [2020-10-16 01:43:03,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1093 transitions. [2020-10-16 01:43:03,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:03,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1093 transitions. [2020-10-16 01:43:03,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:43:03,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:43:03,091 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:43:03,091 INFO L185 Difference]: Start difference. First operand has 80 places, 77 transitions, 752 flow. Second operand 10 states and 1093 transitions. [2020-10-16 01:43:03,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 131 transitions, 1379 flow [2020-10-16 01:43:03,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 131 transitions, 1217 flow, removed 52 selfloop flow, removed 10 redundant places. [2020-10-16 01:43:03,138 INFO L241 Difference]: Finished difference. Result has 84 places, 85 transitions, 783 flow [2020-10-16 01:43:03,138 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=783, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2020-10-16 01:43:03,139 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2020-10-16 01:43:03,139 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 783 flow [2020-10-16 01:43:03,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:03,139 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:03,139 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:03,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:43:03,140 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash 195051027, now seen corresponding path program 2 times [2020-10-16 01:43:03,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:03,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080495266] [2020-10-16 01:43:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:03,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080495266] [2020-10-16 01:43:03,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:03,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 01:43:03,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696891972] [2020-10-16 01:43:03,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 01:43:03,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 01:43:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-10-16 01:43:03,760 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 171 [2020-10-16 01:43:03,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 783 flow. Second operand 14 states. [2020-10-16 01:43:03,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:03,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 171 [2020-10-16 01:43:03,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:05,257 INFO L129 PetriNetUnfolder]: 1013/1874 cut-off events. [2020-10-16 01:43:05,258 INFO L130 PetriNetUnfolder]: For 10010/10463 co-relation queries the response was YES. [2020-10-16 01:43:05,268 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10114 conditions, 1874 events. 1013/1874 cut-off events. For 10010/10463 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11833 event pairs, 128 based on Foata normal form. 100/1967 useless extension candidates. Maximal degree in co-relation 10078. Up to 1014 conditions per place. [2020-10-16 01:43:05,276 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 67 selfloop transitions, 54 changer transitions 66/196 dead transitions. [2020-10-16 01:43:05,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 196 transitions, 2223 flow [2020-10-16 01:43:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 01:43:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 01:43:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1485 transitions. [2020-10-16 01:43:05,282 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2020-10-16 01:43:05,282 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1485 transitions. [2020-10-16 01:43:05,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1485 transitions. [2020-10-16 01:43:05,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:05,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1485 transitions. [2020-10-16 01:43:05,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 01:43:05,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 01:43:05,292 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 01:43:05,292 INFO L185 Difference]: Start difference. First operand has 84 places, 85 transitions, 783 flow. Second operand 15 states and 1485 transitions. [2020-10-16 01:43:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 196 transitions, 2223 flow [2020-10-16 01:43:05,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 196 transitions, 2188 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:05,348 INFO L241 Difference]: Finished difference. Result has 97 places, 112 transitions, 1261 flow [2020-10-16 01:43:05,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1261, PETRI_PLACES=97, PETRI_TRANSITIONS=112} [2020-10-16 01:43:05,349 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2020-10-16 01:43:05,349 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 112 transitions, 1261 flow [2020-10-16 01:43:05,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 01:43:05,349 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:05,349 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:05,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:43:05,350 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:05,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1692329019, now seen corresponding path program 3 times [2020-10-16 01:43:05,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:05,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297873258] [2020-10-16 01:43:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:05,835 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 27 [2020-10-16 01:43:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:06,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297873258] [2020-10-16 01:43:06,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:06,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:43:06,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469561383] [2020-10-16 01:43:06,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:43:06,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:43:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:43:06,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 01:43:06,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 112 transitions, 1261 flow. Second operand 11 states. [2020-10-16 01:43:06,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:06,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 01:43:06,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:06,560 INFO L129 PetriNetUnfolder]: 283/860 cut-off events. [2020-10-16 01:43:06,560 INFO L130 PetriNetUnfolder]: For 5369/5793 co-relation queries the response was YES. [2020-10-16 01:43:06,565 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4631 conditions, 860 events. 283/860 cut-off events. For 5369/5793 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6776 event pairs, 16 based on Foata normal form. 119/974 useless extension candidates. Maximal degree in co-relation 4591. Up to 228 conditions per place. [2020-10-16 01:43:06,569 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 47 selfloop transitions, 11 changer transitions 55/151 dead transitions. [2020-10-16 01:43:06,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 151 transitions, 1907 flow [2020-10-16 01:43:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:43:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:43:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2020-10-16 01:43:06,574 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6146198830409356 [2020-10-16 01:43:06,575 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2020-10-16 01:43:06,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2020-10-16 01:43:06,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:06,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2020-10-16 01:43:06,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:43:06,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:43:06,582 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:43:06,582 INFO L185 Difference]: Start difference. First operand has 97 places, 112 transitions, 1261 flow. Second operand 10 states and 1051 transitions. [2020-10-16 01:43:06,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 151 transitions, 1907 flow [2020-10-16 01:43:06,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 151 transitions, 1839 flow, removed 30 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:06,622 INFO L241 Difference]: Finished difference. Result has 102 places, 95 transitions, 1075 flow [2020-10-16 01:43:06,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1075, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2020-10-16 01:43:06,622 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 67 predicate places. [2020-10-16 01:43:06,623 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 1075 flow [2020-10-16 01:43:06,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:43:06,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:06,623 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:06,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:43:06,623 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1382422621, now seen corresponding path program 4 times [2020-10-16 01:43:06,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:06,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534766065] [2020-10-16 01:43:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:07,016 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2020-10-16 01:43:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:07,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534766065] [2020-10-16 01:43:07,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:07,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:43:07,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99735746] [2020-10-16 01:43:07,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:43:07,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:43:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:43:07,091 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 01:43:07,092 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 1075 flow. Second operand 8 states. [2020-10-16 01:43:07,092 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:07,092 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 01:43:07,092 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:07,586 INFO L129 PetriNetUnfolder]: 195/615 cut-off events. [2020-10-16 01:43:07,586 INFO L130 PetriNetUnfolder]: For 4178/4480 co-relation queries the response was YES. [2020-10-16 01:43:07,589 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 615 events. 195/615 cut-off events. For 4178/4480 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4423 event pairs, 2 based on Foata normal form. 72/686 useless extension candidates. Maximal degree in co-relation 3413. Up to 206 conditions per place. [2020-10-16 01:43:07,593 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 35 selfloop transitions, 25 changer transitions 11/109 dead transitions. [2020-10-16 01:43:07,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 1397 flow [2020-10-16 01:43:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:43:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:43:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 732 transitions. [2020-10-16 01:43:07,595 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6115288220551378 [2020-10-16 01:43:07,595 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 732 transitions. [2020-10-16 01:43:07,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 732 transitions. [2020-10-16 01:43:07,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:07,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 732 transitions. [2020-10-16 01:43:07,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:43:07,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:43:07,599 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:43:07,599 INFO L185 Difference]: Start difference. First operand has 102 places, 95 transitions, 1075 flow. Second operand 7 states and 732 transitions. [2020-10-16 01:43:07,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 1397 flow [2020-10-16 01:43:07,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 109 transitions, 1294 flow, removed 31 selfloop flow, removed 11 redundant places. [2020-10-16 01:43:07,623 INFO L241 Difference]: Finished difference. Result has 95 places, 97 transitions, 1151 flow [2020-10-16 01:43:07,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1151, PETRI_PLACES=95, PETRI_TRANSITIONS=97} [2020-10-16 01:43:07,624 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2020-10-16 01:43:07,624 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 97 transitions, 1151 flow [2020-10-16 01:43:07,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:43:07,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:07,625 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:07,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:43:07,625 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash -416028037, now seen corresponding path program 5 times [2020-10-16 01:43:07,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:07,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308525025] [2020-10-16 01:43:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:07,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308525025] [2020-10-16 01:43:07,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:07,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:43:07,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988207530] [2020-10-16 01:43:07,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:43:07,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:43:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:43:07,850 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 01:43:07,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 1151 flow. Second operand 7 states. [2020-10-16 01:43:07,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:07,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 01:43:07,851 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:08,476 INFO L129 PetriNetUnfolder]: 197/640 cut-off events. [2020-10-16 01:43:08,477 INFO L130 PetriNetUnfolder]: For 4314/4588 co-relation queries the response was YES. [2020-10-16 01:43:08,481 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3587 conditions, 640 events. 197/640 cut-off events. For 4314/4588 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4751 event pairs, 19 based on Foata normal form. 75/713 useless extension candidates. Maximal degree in co-relation 3547. Up to 170 conditions per place. [2020-10-16 01:43:08,493 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 19 selfloop transitions, 40 changer transitions 9/106 dead transitions. [2020-10-16 01:43:08,496 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 106 transitions, 1393 flow [2020-10-16 01:43:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 886 transitions. [2020-10-16 01:43:08,499 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6476608187134503 [2020-10-16 01:43:08,499 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 886 transitions. [2020-10-16 01:43:08,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 886 transitions. [2020-10-16 01:43:08,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:08,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 886 transitions. [2020-10-16 01:43:08,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:08,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:08,505 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:08,505 INFO L185 Difference]: Start difference. First operand has 95 places, 97 transitions, 1151 flow. Second operand 8 states and 886 transitions. [2020-10-16 01:43:08,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 106 transitions, 1393 flow [2020-10-16 01:43:08,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 1318 flow, removed 32 selfloop flow, removed 8 redundant places. [2020-10-16 01:43:08,536 INFO L241 Difference]: Finished difference. Result has 92 places, 95 transitions, 1185 flow [2020-10-16 01:43:08,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1185, PETRI_PLACES=92, PETRI_TRANSITIONS=95} [2020-10-16 01:43:08,536 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 57 predicate places. [2020-10-16 01:43:08,536 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 1185 flow [2020-10-16 01:43:08,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:43:08,537 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:08,537 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:08,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:43:08,537 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:08,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2067201861, now seen corresponding path program 6 times [2020-10-16 01:43:08,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:08,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000548051] [2020-10-16 01:43:08,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:08,926 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2020-10-16 01:43:09,108 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-10-16 01:43:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:09,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000548051] [2020-10-16 01:43:09,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:09,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 01:43:09,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011736721] [2020-10-16 01:43:09,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 01:43:09,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:09,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 01:43:09,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-16 01:43:09,426 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 171 [2020-10-16 01:43:09,427 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 1185 flow. Second operand 12 states. [2020-10-16 01:43:09,427 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:09,427 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 171 [2020-10-16 01:43:09,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:10,609 INFO L129 PetriNetUnfolder]: 528/1088 cut-off events. [2020-10-16 01:43:10,609 INFO L130 PetriNetUnfolder]: For 8931/9064 co-relation queries the response was YES. [2020-10-16 01:43:10,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 1088 events. 528/1088 cut-off events. For 8931/9064 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6733 event pairs, 19 based on Foata normal form. 12/1100 useless extension candidates. Maximal degree in co-relation 6638. Up to 438 conditions per place. [2020-10-16 01:43:10,621 INFO L132 encePairwiseOnDemand]: 159/171 looper letters, 86 selfloop transitions, 45 changer transitions 28/168 dead transitions. [2020-10-16 01:43:10,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 168 transitions, 2296 flow [2020-10-16 01:43:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 01:43:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 01:43:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1247 transitions. [2020-10-16 01:43:10,624 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5609536662168241 [2020-10-16 01:43:10,624 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1247 transitions. [2020-10-16 01:43:10,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1247 transitions. [2020-10-16 01:43:10,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:10,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1247 transitions. [2020-10-16 01:43:10,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 01:43:10,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 01:43:10,633 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 01:43:10,633 INFO L185 Difference]: Start difference. First operand has 92 places, 95 transitions, 1185 flow. Second operand 13 states and 1247 transitions. [2020-10-16 01:43:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 168 transitions, 2296 flow [2020-10-16 01:43:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 168 transitions, 2075 flow, removed 35 selfloop flow, removed 8 redundant places. [2020-10-16 01:43:10,673 INFO L241 Difference]: Finished difference. Result has 100 places, 107 transitions, 1368 flow [2020-10-16 01:43:10,673 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1368, PETRI_PLACES=100, PETRI_TRANSITIONS=107} [2020-10-16 01:43:10,674 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2020-10-16 01:43:10,674 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 1368 flow [2020-10-16 01:43:10,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 01:43:10,674 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:10,674 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:10,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:43:10,675 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1859349261, now seen corresponding path program 7 times [2020-10-16 01:43:10,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:10,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579329978] [2020-10-16 01:43:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:11,184 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 22 [2020-10-16 01:43:11,412 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2020-10-16 01:43:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:11,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579329978] [2020-10-16 01:43:11,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:11,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 01:43:11,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652260343] [2020-10-16 01:43:11,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-16 01:43:11,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-16 01:43:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-16 01:43:11,820 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 171 [2020-10-16 01:43:11,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 1368 flow. Second operand 15 states. [2020-10-16 01:43:11,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:11,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 171 [2020-10-16 01:43:11,821 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:13,012 INFO L129 PetriNetUnfolder]: 505/1060 cut-off events. [2020-10-16 01:43:13,013 INFO L130 PetriNetUnfolder]: For 9600/9727 co-relation queries the response was YES. [2020-10-16 01:43:13,019 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6671 conditions, 1060 events. 505/1060 cut-off events. For 9600/9727 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 6685 event pairs, 165 based on Foata normal form. 45/1105 useless extension candidates. Maximal degree in co-relation 6629. Up to 956 conditions per place. [2020-10-16 01:43:13,026 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 85 selfloop transitions, 51 changer transitions 13/158 dead transitions. [2020-10-16 01:43:13,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 158 transitions, 2268 flow [2020-10-16 01:43:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 01:43:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 01:43:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1311 transitions. [2020-10-16 01:43:13,031 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2020-10-16 01:43:13,031 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1311 transitions. [2020-10-16 01:43:13,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1311 transitions. [2020-10-16 01:43:13,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:13,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1311 transitions. [2020-10-16 01:43:13,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 01:43:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 01:43:13,038 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 01:43:13,038 INFO L185 Difference]: Start difference. First operand has 100 places, 107 transitions, 1368 flow. Second operand 14 states and 1311 transitions. [2020-10-16 01:43:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 158 transitions, 2268 flow [2020-10-16 01:43:13,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 158 transitions, 2164 flow, removed 24 selfloop flow, removed 7 redundant places. [2020-10-16 01:43:13,087 INFO L241 Difference]: Finished difference. Result has 108 places, 144 transitions, 1959 flow [2020-10-16 01:43:13,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1959, PETRI_PLACES=108, PETRI_TRANSITIONS=144} [2020-10-16 01:43:13,088 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 73 predicate places. [2020-10-16 01:43:13,088 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 144 transitions, 1959 flow [2020-10-16 01:43:13,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-16 01:43:13,088 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:13,088 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:13,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:43:13,089 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1622846571, now seen corresponding path program 8 times [2020-10-16 01:43:13,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:13,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58023685] [2020-10-16 01:43:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:13,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58023685] [2020-10-16 01:43:13,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:13,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:43:13,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829136197] [2020-10-16 01:43:13,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:43:13,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:43:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:43:13,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 171 [2020-10-16 01:43:13,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 144 transitions, 1959 flow. Second operand 10 states. [2020-10-16 01:43:13,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:13,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 171 [2020-10-16 01:43:13,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:14,578 INFO L129 PetriNetUnfolder]: 844/1724 cut-off events. [2020-10-16 01:43:14,578 INFO L130 PetriNetUnfolder]: For 15228/15371 co-relation queries the response was YES. [2020-10-16 01:43:14,587 INFO L80 FinitePrefix]: Finished finitePrefix Result has 11139 conditions, 1724 events. 844/1724 cut-off events. For 15228/15371 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 11842 event pairs, 66 based on Foata normal form. 24/1748 useless extension candidates. Maximal degree in co-relation 11096. Up to 661 conditions per place. [2020-10-16 01:43:14,591 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 64 selfloop transitions, 45 changer transitions 156/273 dead transitions. [2020-10-16 01:43:14,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 273 transitions, 4057 flow [2020-10-16 01:43:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 01:43:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 01:43:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1165 transitions. [2020-10-16 01:43:14,594 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.567738791423002 [2020-10-16 01:43:14,594 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1165 transitions. [2020-10-16 01:43:14,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1165 transitions. [2020-10-16 01:43:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:14,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1165 transitions. [2020-10-16 01:43:14,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 01:43:14,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 01:43:14,598 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 01:43:14,598 INFO L185 Difference]: Start difference. First operand has 108 places, 144 transitions, 1959 flow. Second operand 12 states and 1165 transitions. [2020-10-16 01:43:14,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 273 transitions, 4057 flow [2020-10-16 01:43:14,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 273 transitions, 3884 flow, removed 76 selfloop flow, removed 6 redundant places. [2020-10-16 01:43:14,699 INFO L241 Difference]: Finished difference. Result has 116 places, 100 transitions, 1423 flow [2020-10-16 01:43:14,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1794, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1423, PETRI_PLACES=116, PETRI_TRANSITIONS=100} [2020-10-16 01:43:14,699 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2020-10-16 01:43:14,699 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 100 transitions, 1423 flow [2020-10-16 01:43:14,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:43:14,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:14,700 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:14,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:43:14,700 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:14,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash 793889513, now seen corresponding path program 9 times [2020-10-16 01:43:14,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:14,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904203865] [2020-10-16 01:43:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:15,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904203865] [2020-10-16 01:43:15,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:15,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:43:15,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712356221] [2020-10-16 01:43:15,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:43:15,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:43:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:43:15,029 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 171 [2020-10-16 01:43:15,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 100 transitions, 1423 flow. Second operand 9 states. [2020-10-16 01:43:15,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:15,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 171 [2020-10-16 01:43:15,030 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:15,519 INFO L129 PetriNetUnfolder]: 174/501 cut-off events. [2020-10-16 01:43:15,519 INFO L130 PetriNetUnfolder]: For 5679/5753 co-relation queries the response was YES. [2020-10-16 01:43:15,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 501 events. 174/501 cut-off events. For 5679/5753 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3103 event pairs, 8 based on Foata normal form. 67/568 useless extension candidates. Maximal degree in co-relation 3502. Up to 217 conditions per place. [2020-10-16 01:43:15,525 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 57 selfloop transitions, 17 changer transitions 22/134 dead transitions. [2020-10-16 01:43:15,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 134 transitions, 1970 flow [2020-10-16 01:43:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 919 transitions. [2020-10-16 01:43:15,527 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6717836257309941 [2020-10-16 01:43:15,527 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 919 transitions. [2020-10-16 01:43:15,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 919 transitions. [2020-10-16 01:43:15,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:15,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 919 transitions. [2020-10-16 01:43:15,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:15,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:15,529 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:15,529 INFO L185 Difference]: Start difference. First operand has 116 places, 100 transitions, 1423 flow. Second operand 8 states and 919 transitions. [2020-10-16 01:43:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 134 transitions, 1970 flow [2020-10-16 01:43:15,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 134 transitions, 1670 flow, removed 87 selfloop flow, removed 16 redundant places. [2020-10-16 01:43:15,551 INFO L241 Difference]: Finished difference. Result has 97 places, 82 transitions, 931 flow [2020-10-16 01:43:15,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=931, PETRI_PLACES=97, PETRI_TRANSITIONS=82} [2020-10-16 01:43:15,551 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2020-10-16 01:43:15,551 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 82 transitions, 931 flow [2020-10-16 01:43:15,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:43:15,552 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:15,552 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:15,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 01:43:15,552 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -228954841, now seen corresponding path program 10 times [2020-10-16 01:43:15,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:15,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857367129] [2020-10-16 01:43:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:43:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:43:15,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857367129] [2020-10-16 01:43:15,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:43:15,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:43:15,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983505500] [2020-10-16 01:43:15,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:43:15,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:43:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:43:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:43:15,989 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 171 [2020-10-16 01:43:15,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 82 transitions, 931 flow. Second operand 10 states. [2020-10-16 01:43:15,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:43:15,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 171 [2020-10-16 01:43:15,991 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:43:16,674 INFO L129 PetriNetUnfolder]: 185/506 cut-off events. [2020-10-16 01:43:16,674 INFO L130 PetriNetUnfolder]: For 3381/3439 co-relation queries the response was YES. [2020-10-16 01:43:16,678 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3066 conditions, 506 events. 185/506 cut-off events. For 3381/3439 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3207 event pairs, 6 based on Foata normal form. 57/563 useless extension candidates. Maximal degree in co-relation 3035. Up to 229 conditions per place. [2020-10-16 01:43:16,681 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 19 selfloop transitions, 17 changer transitions 37/101 dead transitions. [2020-10-16 01:43:16,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 1249 flow [2020-10-16 01:43:16,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:43:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:43:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 849 transitions. [2020-10-16 01:43:16,684 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6206140350877193 [2020-10-16 01:43:16,684 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 849 transitions. [2020-10-16 01:43:16,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 849 transitions. [2020-10-16 01:43:16,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:43:16,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 849 transitions. [2020-10-16 01:43:16,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:43:16,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:43:16,689 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:43:16,689 INFO L185 Difference]: Start difference. First operand has 97 places, 82 transitions, 931 flow. Second operand 8 states and 849 transitions. [2020-10-16 01:43:16,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 1249 flow [2020-10-16 01:43:16,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 1052 flow, removed 42 selfloop flow, removed 19 redundant places. [2020-10-16 01:43:16,723 INFO L241 Difference]: Finished difference. Result has 81 places, 61 transitions, 572 flow [2020-10-16 01:43:16,723 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=572, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2020-10-16 01:43:16,723 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 46 predicate places. [2020-10-16 01:43:16,724 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 572 flow [2020-10-16 01:43:16,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:43:16,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:43:16,724 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:43:16,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 01:43:16,724 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:43:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:43:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -818180533, now seen corresponding path program 11 times [2020-10-16 01:43:16,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:43:16,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662433523] [2020-10-16 01:43:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:43:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:43:16,823 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:43:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:43:16,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:43:16,967 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:43:16,968 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:43:16,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 01:43:16,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:16,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,000 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,001 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,002 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,003 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,004 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,005 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,006 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,006 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,007 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,007 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,008 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,008 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,009 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,009 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,010 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,010 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,011 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,011 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,012 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,012 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,013 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,013 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,014 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,014 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,015 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,016 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,017 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,018 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,019 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,020 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,021 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,022 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:43:17,022 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:43:17,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:43:17 BasicIcfg [2020-10-16 01:43:17,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:43:17,089 INFO L168 Benchmark]: Toolchain (without parser) took 30663.89 ms. Allocated memory was 251.7 MB in the beginning and 907.5 MB in the end (delta: 655.9 MB). Free memory was 206.7 MB in the beginning and 462.8 MB in the end (delta: -256.1 MB). Peak memory consumption was 399.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,089 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:43:17,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.14 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 206.7 MB in the beginning and 265.6 MB in the end (delta: -58.8 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 315.6 MB. Free memory was 265.6 MB in the beginning and 260.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,091 INFO L168 Benchmark]: Boogie Preprocessor took 49.98 ms. Allocated memory is still 315.6 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,091 INFO L168 Benchmark]: RCFGBuilder took 3988.65 ms. Allocated memory was 315.6 MB in the beginning and 431.5 MB in the end (delta: 115.9 MB). Free memory was 258.0 MB in the beginning and 364.6 MB in the end (delta: -106.6 MB). Peak memory consumption was 157.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,092 INFO L168 Benchmark]: TraceAbstraction took 25762.07 ms. Allocated memory was 431.5 MB in the beginning and 907.5 MB in the end (delta: 476.1 MB). Free memory was 364.6 MB in the beginning and 462.8 MB in the end (delta: -98.2 MB). Peak memory consumption was 377.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:43:17,095 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.21 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 783.14 ms. Allocated memory was 251.7 MB in the beginning and 315.6 MB in the end (delta: 64.0 MB). Free memory was 206.7 MB in the beginning and 265.6 MB in the end (delta: -58.8 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.32 ms. Allocated memory is still 315.6 MB. Free memory was 265.6 MB in the beginning and 260.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.98 ms. Allocated memory is still 315.6 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3988.65 ms. Allocated memory was 315.6 MB in the beginning and 431.5 MB in the end (delta: 115.9 MB). Free memory was 258.0 MB in the beginning and 364.6 MB in the end (delta: -106.6 MB). Peak memory consumption was 157.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 25762.07 ms. Allocated memory was 431.5 MB in the beginning and 907.5 MB in the end (delta: 476.1 MB). Free memory was 364.6 MB in the beginning and 462.8 MB in the end (delta: -98.2 MB). Peak memory consumption was 377.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 972 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.2s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 26 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5549 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2336; [L844] FCALL, FORK 0 pthread_create(&t2336, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L845] 0 pthread_t t2337; [L846] FCALL, FORK 0 pthread_create(&t2337, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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=1, 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] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$r_buff0_thd2=1, 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] [L847] 0 pthread_t t2338; [L848] FCALL, FORK 0 pthread_create(&t2338, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 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) [L809] 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) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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) [L815] 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)) [L815] 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)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L821] 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) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 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 [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 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 [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L736] 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) [L736] 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) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 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 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 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 [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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=2, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] 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) [L759] 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) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 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 [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 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 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L788] 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) [L788] 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) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 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 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 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 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] 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) [L854] 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) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 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 [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 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 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 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) [L865] 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) [L866] 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)) [L866] 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)) [L867] 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)) [L867] 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)) [L868] 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)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] 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)) [L868] 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)) [L869] 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)) [L869] 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) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, 93 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: 25.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 120 SDtfs, 186 SDslu, 283 SDs, 0 SdLazy, 2706 SolverSat, 514 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1959occurred 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.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 370 ConstructedInterpolants, 0 QuantifiedInterpolants, 94692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...